default search action
José A. Ventura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j52]Omar Abbaas
, José A. Ventura:
A flexible combinatorial auction bidding language for supplier selection and order allocation in a supply chain with price sensitive demand. Comput. Ind. Eng. 194: 110373 (2024) - [j51]Kevin A. Bunn, José A. Ventura:
Reformulations to improve the Lagrangian relaxation approach for the capacitated multi-product dynamic lot sizing problem with batch ordering. Int. J. Prod. Res. 62(8): 2868-2887 (2024) - [j50]Omar Abbaas
A multi-agent resource bidding algorithm for order acceptance and assembly job shop scheduling. Int. J. Prod. Res. 62(13): 4856-4883 (2024) - 2023
- [j49]José A. Ventura, Qingyuan Lu:
Optimizing Supplier Selection and Order Lot-Sizing Decisions in a Two-Stage Supply Chain. Axioms 12(7): 615 (2023) - [j48]Kevin A. Bunn, José A. Ventura
A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs. Eur. J. Oper. Res. 307(1): 116-129 (2023) - 2022
- [j47]José A. Ventura, Boaz Golany, Abraham Mendoza
A multi-product dynamic supply chain inventory model with supplier selection, joint replenishment, and transportation cost. Ann. Oper. Res. 316(2): 729-762 (2022) - [j46]Omar Abbaas
An edge scanning method for the continuous deviation-flow refueling station location problem on a general network. Networks 79(3): 264-291 (2022) - [j45]Omar Abbaas
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network. Optim. Lett. 16(3): 953-982 (2022) - 2021
- [j44]Lisha Duan, José A. Ventura
Technical Note: A Joint Pricing, Supplier Selection, and Inventory Replenishment Model Using the Logit Demand Function. Decis. Sci. 52(2): 512-534 (2021) - [j43]Xin Li, José A. Ventura
A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime. J. Sched. 24(1): 49-68 (2021)
2010 – 2019
- 2019
- [j42]Lisha Duan, José A. Ventura
A Dynamic Supplier Selection and Inventory Management Model for a Serial Supply Chain with a Novel Supplier Price Break Scheme and Flexible Time Periods. Eur. J. Oper. Res. 272(3): 979-998 (2019) - 2018
- [j41]Bárbara Venegas, José A. Ventura
A two-stage supply chain coordination mechanism considering price sensitive demand and quantity discounts. Eur. J. Oper. Res. 264(2): 524-533 (2018) - 2017
- [j40]Seong Wook Hwang, Sang Jin Kweon
Locating alternative-fuel refueling stations on a multi-class vehicle transportation network. Eur. J. Oper. Res. 261(3): 941-957 (2017) - 2016
- [j39]Ronald G. McGarvey
Binary linear programming models for robust broadcasting in communication networks. Discret. Appl. Math. 204: 173-184 (2016) - 2015
- [j38]José A. Ventura, Seong Wook Hwang, Sang Jin Kweon
A continuous network location problem for a single refueling station on a tree. Comput. Oper. Res. 62: 257-265 (2015) - [j37]Hamza Adeinat
Determining the retailer's replenishment policy considering multiple capacitated suppliers and price-sensitive demand. Eur. J. Oper. Res. 247(1): 83-92 (2015) - 2013
- [j36]José A. Ventura, Victor A. Valdebenito, Boaz Golany:
A dynamic inventory model with supplier selection in a serial supply chain structure. Eur. J. Oper. Res. 230(2): 258-271 (2013) - [j35]José A. Ventura, Suk-Hun Yoon:
A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers. J. Intell. Manuf. 24(6): 1185-1196 (2013) - [j34]Abraham Mendoza
Modeling actual transportation costs in supplier selection and order quantity allocation decisions. Oper. Res. 13(1): 5-25 (2013) - 2010
- [j33]Aixa Cintron, A. Ravi Ravindran, José A. Ventura:
Multi-criteria mathematical model for designing the distribution network of a consumer goods company. Comput. Ind. Eng. 58(4): 584-593 (2010) - [j32]Brian Q. Rieksts, José A. Ventura:
Two-stage inventory models with a bi-modal transportation cost. Comput. Oper. Res. 37(1): 20-31 (2010) - [j31]Abraham Mendoza
A serial inventory system with supplier selection and order quantity allocation. Eur. J. Oper. Res. 207(3): 1304-1315 (2010)
2000 – 2009
- 2009
- [j30]Brian Q. Rieksts, José A. Ventura, Yale T. Herer:
Power-of-two policies for single-warehouse multi-retailer inventory systems with order frequency discounts. Comput. Oper. Res. 36(7): 2286-2294 (2009) - [j29]José A. Ventura, Brian Q. Rieksts:
Optimal location of dwell points in a single loop AGV system with time restrictions on vehicle availability. Eur. J. Oper. Res. 192(1): 93-104 (2009) - [j28]Abraham Mendoza
Estimating freight rates in inventory replenishment and supplier selection decisions. Logist. Res. 1(3-4): 185-196 (2009) - [j27]Brian Q. Rieksts, José A. Ventura:
Time-Relaxed 1-Fault Tolerant Broadcast Networks. Parallel Process. Lett. 19(2): 335-353 (2009) - 2008
- [j26]Brian Q. Rieksts, José A. Ventura:
Optimal inventory policies with two modes of freight transportation. Eur. J. Oper. Res. 186(2): 576-585 (2008) - 2007
- [j25]Brian Q. Rieksts, José A. Ventura:
A Compounding Algorithm for 1-Fault Tolerant Broadcast Networks. Asia Pac. J. Oper. Res. 24(5): 687-713 (2007) - 2004
- [j24]S. I. Brown, Ronald G. McGarvey
Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated. J. Oper. Res. Soc. 55(6): 614-621 (2004) - 2003
- [j23]Shiwoo Lee, José A. Ventura:
Construction of Time-Relaxed c-Broadcast Networks. Telecommun. Syst. 24(1): 47-59 (2003) - 2002
- [j22]Suk-Hun Yoon, José A. Ventura:
Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling. Comput. Oper. Res. 29(10): 1301-1315 (2002) - 2001
- [j21]Shiwoo Lee, José A. Ventura:
An algorithm for constructing minimal c-broadcast networks. Networks 38(1): 6-21 (2001) - [j20]Shang-Tae Yee, Wenhua Wan, José A. Ventura:
3-D localization and feature recovering through CAD-based stable pose calculation. Pattern Recognit. Lett. 22(2): 105-121 (2001)
1990 – 1999
- 1999
- [j19]Michael J. Dinneen, José A. Ventura, Mark C. Wilson, Golbon Zakeri
Compound Constructions of Broadcast Networks. Discret. Appl. Math. 93(2-3): 205-232 (1999) - [j18]Michael J. Dinneen, José A. Ventura, Mark C. Wilson, Golbon Zakeri
Construction of Time Relaxed Minimal Broadcast Networks. Parallel Process. Lett. 9(1): 53-68 (1999) - 1998
- [j17]Chih-Hang Wu
Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. Comput. Oper. Res. 25(4): 333-349 (1998) - 1997
- [j16]Wenhua Wan, José A. Ventura:
Segmentation of Planar Curves into Straight-Line Segments and Elliptical Arcs. CVGIP Graph. Model. Image Process. 59(6): 484-494 (1997) - [j15]José A. Ventura, Wenhua Wan:
Accurate matching of two-dimensional shapes using the minimal tolerance zone error. Image Vis. Comput. 15(12): 889-899 (1997) - 1996
- [j14]Jen-Ming Chen, José A. Ventura, Chih-Hang Wu
Segmentation of planar curves into circular arcs and line segments. Image Vis. Comput. 14(1): 71-83 (1996) - [j13]José A. Ventura, Jen-Ming Chen:
A structural model for shape recognition using neural nets. J. Intell. Manuf. 7(1): 1-11 (1996) - 1995
- [j12]José A. Ventura, Michael X. Weng:
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date. Oper. Res. Lett. 17(3): 149-152 (1995) - [j11]Jen-Ming Chen, José A. Ventura:
Optimization models for shape matching of nonconvex polygons. Pattern Recognit. 28(6): 863-877 (1995) - [j10]José A. Ventura, Nain Ling-Ying, Wenhua Wan:
Optimal matching of general polygons based on the minimum zone error. Pattern Recognit. Lett. 16(11): 1125-1136 (1995) - 1994
- [j9]Jen-Ming Chen, José A. Ventura, Brian J. Melloy:
An optimization algorithm for shape analysis of regular polygons. Mach. Vis. Appl. 7(2): 82-92 (1994) - [j8]Michael X. Weng, José A. Ventura:
A quadratic integer programming method for minimizing the mean squared deviation of completion times. Oper. Res. Lett. 15(4): 205-211 (1994) - [j7]Michael X. Weng, José A. Ventura:
A doubling procedure for constructing minimal broadcast networks. Telecommun. Syst. 3(3): 259-293 (1994) - 1993
- [j6]José A. Ventura, Donald W. Hearn:
Restricted simplicial decomposition for convex constrained problems. Math. Program. 59: 71-85 (1993) - [j5]José A. Ventura, Xiaohua Weng:
A new method for constructing minimal broadcast networks. Networks 23(5): 481-497 (1993) - [j4]José A. Ventura, Jen-Ming Chen:
Optimal matching of nonconvex polygons. Pattern Recognit. Lett. 14(6): 445-452 (1993) - 1992
- [j3]José A. Ventura, Chih-Hang Wu:
Computer vision inspection of elliptical profiles. Appl. Artif. Intell. 6(4): 511-528 (1992) - [j2]José A. Ventura, Jen-Ming Chen:
Segmentation of two-dimensional curve contours. Pattern Recognit. 25(10): 1129-1140 (1992) - 1991
- [j1]José A. Ventura:
Computational development of a lagrangian dual approach for quadratic networks. Networks 21(4): 469-485 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: