The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Exploring relaxation induced neighborhoods to improve MIP solutions
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
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
The Shifting Bottleneck Procedure for Job Shop Scheduling
Adams, J., Balas, E., & Zawack, D. J. (1988) · Management Science · doi:10.1287/mnsc.34.3.391 · Cited by 1,603
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
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
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90007-k · Cited by 843
Fundamentals of Scatter Search and Path Relinking
Glover, F., Laguna, M., & Martí, R. (2000) · Cited by 743
The Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
MIP: Theory and Practice — Closing the Gap
Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35514-6_2 · Cited by 258
Self-citationPivot and Complement–A Heuristic for 0-1 Programming
Balas, E., & Martin, C. H. (1980) · Management Science · doi:10.1287/mnsc.26.1.86 · Cited by 257
Local search with constraint propagation and conflict-based heuristics
Jussien, N., & Lhomme, O. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00221-7 · Cited by 184
Recent Advances in Crew-Pairing Optimization at American Airlines
Anbil, R., Gelman, E., Patty, B. W., & Tanga, R. (1991) · INFORMS Journal on Applied Analytics · doi:10.1287/inte.21.1.62 · Cited by 151
A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem
Vázquez, M., & Whitley, D. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45356-3_30 · Cited by 58
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
Integer and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
Mixed-integer nonlinear optimization
Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., & Mahajan, A. (2013) · Acta Numerica · doi:10.1017/s0962492913000032 · Cited by 712
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016) · Discrete Optimization · doi:10.1016/j.disopt.2016.01.005 · Cited by 563
Metadata
- Authors
- Danna, E., Rothberg, E., & Pape, C. L.
- Venue
- Mathematical Programming
- Published
- 2004-05-21
- Volume
- 102
- Issue
- 1
- Pages
- 71-90
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2004489140
- Cited by
- 530
- References
- 15
- FWCI
- 16.74
- 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.