The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
Abstract
The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using either of the two methods. The class of problems considered in this paper have the characteristic that only a subset of the binary variables have non-zero objective function coefficients if modeled as an MILP. This class of problems is formulated as a hybrid MILP/CP model that involves some of the MILP constraints, a reduced set of the CP constraints, and equivalence relations between the MILP and the CP variables. An MILP/CP based decomposition method and an LP/CP-based branch-and-bound algorithm are proposed to solve these hybrid models. Both these algorithms rely on the same relaxed MILP and feasibility CP problems. An application example is considered in which the least-cost schedule has to be derived for processing a set of orders with release and due dates using a set of dissimilar parallel machines. It is shown that this problem can be modeled as an MILP, a CP, a combined MILP-CP OPL model (Van Hentenryck 1999), and a hybrid MILP/CP model. The computational performance of these models for several sets shows that the hybrid MILP/CP model can achieve two to three orders of magnitude reduction in CPU time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
Foundations of Constraint Satisfaction
(1993) · Elsevier eBooks · doi:10.1016/c2013-0-07627-x · Cited by 1,629
Constraint satisfaction in logic programming
Hentenryck, P. V. (1989) · Medical Entomology and Zoology · Cited by 1,218
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Padberg, M., & Rinaldi, G. (1991) · SIAM Review · doi:10.1137/1033004 · Cited by 1,097
A Computational Study of the Job-Shop Scheduling Problem
Applegate, D., & Cook, W. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.2.149 · Cited by 908
Programming with Constraints: An Introduction
Marriott, K., & Stuckey, P. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/5625.001.0001 · Cited by 864
An Algorithm for Solving the Job-Shop Problem
Carlier, J., & Pinson, É. (1989) · Management Science · doi:10.1287/mnsc.35.2.164 · Cited by 824
The Constraint Logic Programming Language CHIP.
Dincbas, M., Hentenryck, P. V., Simonis, H., Aggoun, A., Graf, T., & Berthier, F. (1988) · Future Generation Computer Systems · Cited by 508
An LP/NLP based branch and bound algorithm for convex MINLP optimization problems
Quesada, I., & Grossmann, I. E. (1992) · Computers & Chemical Engineering · doi:10.1016/0098-1354(92)80028-8 · Cited by 455
Self-citationLogic-based methods for optimization: combining optimization and constraint satisfaction
(2001) · Choice Reviews Online · doi:10.5860/choice.38-3939 · Cited by 304
Logic‐Based Methods for Optimization: Combining Optimization and Constraint Satisfaction
Hooker, J. (2000) · Wiley eBooks · doi:10.1002/9781118033036 · Cited by 292
Pape, C. L. (1994) · Intelligent Systems Engineering · doi:10.1049/ise.1994.0009 · Cited by 172
Mixed logical-linear programming
Hooker, J., & Osorio, M. A. (1999) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(99)00100-6 · Cited by 159
Cumulative Scheduling with Task Intervals.
Caseau, Y., & Laburthe, F. (1996) · Cited by 98
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
SCIP: solving constraint integer programs
Achterberg, T. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-008-0001-1 · Cited by 1,167
State-of-the-art review of optimization methods for short-term scheduling of batch processes
Méndez, C. A., Cerdá, J., Grossmann, I. E., Harjunkoski, I., & Fahl, M. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.02.008 · Cited by 809
Self-citationLogic-based Benders decomposition
Hooker, J. N., & Ottosson, G. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0375-9 · Cited by 595
Ham, A. M. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.03.025 · Cited by 323
Metadata
- Authors
- Jain, V., & Grossmann, I. E.
- Venue
- INFORMS Journal on Computing
- Published
- 2001-11
- Volume
- 13
- Issue
- 4
- Pages
- 258-276
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2097731353
- Cited by
- 400
- References
- 17
- FWCI
- 22.50
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.