The DOI matches its Crossref record.
Integer and Combinatorial Optimization
Abstract
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such f
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
Cited by
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
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
Self-citationTelephone Call Centers: Tutorial, Review, and Research Prospects
Gans, N., Koole, G., & Mandelbaum, A. (2003) · Manufacturing & Service Operations Management · doi:10.1287/msom.5.2.79.16071 · Cited by 1,360
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
Shanmugam, K., Golrezaei, N., Dimakis, A. G., Molisch, A. F., & Caire, G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2281606 · Cited by 1,246
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
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
Combinatorial Auctions: A Survey
de Vries, S., & Vohra, R. V. (2003) · INFORMS Journal on Computing · doi:10.1287/ijoc.15.3.284.16077 · Cited by 985
A Model Predictive Control Approach to Microgrid Operation Optimization
Parisio, A., Rikos, E., & Glielmo, L. (2014) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2013.2295737 · Cited by 929
Venter, G., & Sobieszczanski-Sobieski, J. (2003) · AIAA Journal · doi:10.2514/2.2111 · Cited by 802
On the complexity of sphere decoding in digital communications
Jalden, J., & Ottersten, B. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.843746 · Cited by 720
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
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
A Joint Location-Inventory Model
Shen, Z.-J. M., Coullard, C., & Daskin, M. S. (2003) · Transportation Science · doi:10.1287/trsc.37.1.40.12823 · Cited by 660
Shortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Column Generation · doi:10.1007/0-387-25486-2_2 · Cited by 597
Biegler, L. T., & Grossmann, I. E. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.11.003 · Cited by 593
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
The Air Traffic Flow Management Problem with Enroute Capacities
Bertsimas, D., & Patterson, S. S. (1998) · Operations Research · doi:10.1287/opre.46.3.406 · Cited by 540
Identifying functional modules in protein–protein interaction networks: an integrated exact approach
Dittrich, M. T., Klau, G. W., Rosenwald, A., Dandekar, T., & Müller, T. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn161 · Cited by 530
Global Optimization by Multilevel Coordinate Search
Huyer, W., & Neumaier, A. (1999) · Journal of Global Optimization · doi:10.1023/a:1008382309369 · Cited by 505
Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection
Doerner, K., Gutjahr, W. J., Hartl, R. F., Strauss, C., & Stummer, C. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039513.99038.c6 · Cited by 446
A Branch-and-Price Algorithm for the Generalized Assignment Problem
Savelsbergh, M. (1997) · Operations Research · doi:10.1287/opre.45.6.831 · Cited by 437
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008) · Operations Research · doi:10.1287/opre.1070.0449 · Cited by 410
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Smith, K. A. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.1.15 · Cited by 401
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
Jain, V., & Grossmann, I. E. (2001) · INFORMS Journal on Computing · doi:10.1287/ijoc.13.4.258.9733 · Cited by 400
Swarm Intelligence in Optimization
Blum, C., & Li, X. (2008) · Natural Computing Series · doi:10.1007/978-3-540-74089-6_2 · Cited by 396
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
Desrosiers, J., & Lübbecke, M. E. (2006) · Column Generation · doi:10.1007/0-387-25486-2_1 · Cited by 363
Models and solution techniques for frequency assignment problems
Aardal, K. I., van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C., & Sassano, A. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0178-0 · Cited by 339
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
Barnhart, C., Hane, C. A., & Vance, P. H. (2000) · Operations Research · doi:10.1287/opre.48.2.318.12378 · Cited by 325
Puchinger, J., & Raidl, G. R. (2005) · Lecture Notes in Computer Science · doi:10.1007/11499305_5 · Cited by 323
Fundamental Green Tradeoffs: Progresses, Challenges, and Impacts on 5G Networks
Zhang, S., Wu, Q., Xu, S., & Li, G. Y. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2594120 · Cited by 321
Cloud task scheduling based on ant colony optimization
Tawfeek, M. A., El-Sisi, A., Keshk, A. E., & Torkey, F. A. (2013) · 2013 8th International Conference on Computer Engineering & Systems (ICCES) · doi:10.1109/icces.2013.6707172 · Cited by 303
Particle swarm optimization for integer programming
Laskari, E. C., Parsopoulos, K. E., & Vrahatis, M. N. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004478 · Cited by 299
Logic‐Based Methods for Optimization: Combining Optimization and Constraint Satisfaction
Hooker, J. (2000) · Wiley eBooks · doi:10.1002/9781118033036 · Cited by 292
Vanderbeck, F. (2000) · Operations Research · doi:10.1287/opre.48.1.111.12453 · Cited by 291
Improving Variational Quantum Optimization using CVaR
Barkoutsos, P. K., Nannicini, G., Robert, A., Tavernelli, I., & Woerner, S. (2020) · Quantum · doi:10.22331/q-2020-04-20-256 · Cited by 263
Multidisciplinary optimization of a transport aircraft wing using particle swarm optimization
Venter, G., & Sobieszczanski-Sobieski, J. (2004) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-003-0318-3 · Cited by 260
An integer linear programming approach for finding deregulated subgraphs in regulatory networks
Backes, C., Rurainski, A., Klau, G. W., Müller, O., Stöckel, D., Gerasch, A., Küntzer, J., Maisel, D., Ludwig, N., Hein, M., et al. (2012) · Nucleic Acids Research · doi:10.1093/nar/gkr1227 · Cited by 259
Load Scheduling for Household Energy Consumption Optimization
Agnetis, A., de Pascale, G., Detti, P., & Vicino, A. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2013.2254506 · Cited by 257
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Formulating and Solving Routing Problems on Quantum Computers
Harwood, S., Gambella, C., Trenev, D., Simonetto, A., Bernal Neira, D., & Greenberg, D. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3049230 · Cited by 145
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
Carlone, L., & Censi, A. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2013.2291626 · Cited by 79
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
Macambira, E. M., & de Souza, C. C. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00262-3 · Cited by 55
Minimizing Total Weighted Tardiness on a Single Machine with Release Dates and Equal-Length Jobs
van den Akker, J. M., Diepen, G., & Hoogeveen, J. A. (2010) · Journal of Scheduling · doi:10.1007/s10951-010-0181-1 · Cited by 30
“…fact that if each optimal solution is nested, the constraint matrix for the non-zero columns (i.e. columns for which the value is greater than 0) of the solution can be reordered in such a way that it forms an interval matrix, which are known to be totally unimodular (Nemhauser and Wolsey 1988).”
Background
Metadata
- Authors
- Nemhauser, G., & Wolsey, L.
- Venue
- Wiley eBooks
- Publisher
- Wiley
- Published
- 1988-06-16
- OpenAlex
- W2505968561
- Cited by
- 3,176
- References
- 0
- FWCI
- 6.48
- Type
- book
- 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.