The DOI matches its OpenAlex record.
Integer and Combinatorial Optimization
Abstract
FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory. Computational Complexity. Polynomial-Time Algorithms for Linear Programming. Integer Lattices. GENERAL INTEGER PROGRAMMING. The Theory of Valid Inequalities. Strong Valid Inequalities and Facets for Structured Integer Programs. Duality and Relaxation. General Algorithms. Special-Purpose Algorithms. Applications of Special- Purpose Algorithms. COMBINATORIAL OPTIMIZATION. Integral Polyhedra. Matching. Matroid and Submodular Function Optimization. References. Indexes.
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
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
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-citationRobust discrete optimization and network flows
Bertsimas, D., & Sim, M. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0396-4 · Cited by 1,799
A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem
Carrion, M., & Arroyo, J. M. (2006) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2006.876672 · Cited by 1,731
Towards Total Recall in Industrial Anomaly Detection
Roth, K., Pemula, L., Zepeda, J., Scholkopf, B., Brox, T., & Gehler, P. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01392 · Cited by 1,810
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
Learning to learn by gradient descent by gradient descent
Andrychowicz, M., Denil, M., Gomez, S., Hoffman, M. W., Pfau, D., Schaul, T., Shillingford, B., & de Freitas, N. (2016) · arXiv · doi:10.48550/arxiv.1606.04474 · Cited by 1,486
Predictive Control for Linear and Hybrid Systems
Borrelli, F., Bemporad, A., & Morari, M. (2017) · Cambridge University Press eBooks · doi:10.1017/9781139061759 · Cited by 1,443
Telephone 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
Ant colony optimization: Introduction and recent trends
Blum, C. (2005) · Physics of Life Reviews · doi:10.1016/j.plrev.2005.10.001 · Cited by 1,308
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
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
Integer and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
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
A survey of computational complexity results in systems and control
Blondel, V. D., & Tsitsiklis, J. N. (2000) · Automatica · doi:10.1016/s0005-1098(00)00050-9 · Cited by 732
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
FemtoCaching: Wireless video content delivery through distributed caching helpers
Golrezaei, N., Shanmugam, K., Dimakis, A. G., Molisch, A. F., & Caire, G. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195469 · Cited by 711
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
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
Economic Valuation of Reserves in Power Systems With High Penetration of Wind Power
Morales, J. M., Conejo, A. J., & Perez-Ruiz, J. (2009) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2009.2016598 · Cited by 573
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
Tawarmalani, M., & Sahinidis, N. V. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0467-6 · Cited by 569
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
Principles of optimal design-modeling and computation
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90173-0 · Cited by 544
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
Design of reserve networks and the persistence of biodiversity
Cabeza, M., & Moilanen, A. (2001) · Trends in Ecology & Evolution · doi:10.1016/s0169-5347(01)02125-5 · Cited by 484
Bagnara, R., Hill, P. M., & Zaffanella, E. (2008) · Science of Computer Programming · doi:10.1016/j.scico.2007.08.001 · Cited by 477
A wrapper method for feature selection using Support Vector Machines
Maldonado, S., & Weber, R. (2009) · Information Sciences · doi:10.1016/j.ins.2009.02.014 · Cited by 473
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
Tractable Models for Information Diffusion in Social Networks
Kimura, M., & Saito, K. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871637_27 · Cited by 444
Di, B., Song, L., & Li, Y. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2606100 · Cited by 444
Complete search in continuous global optimization and constraint satisfaction
Neumaier, A. (2004) · Acta Numerica · doi:10.1017/s0962492904000194 · Cited by 430
Constrained Optimal Control of Linear and Hybrid Systems
(2003) · Lecture Notes in Control and Information Sciences · doi:10.1007/3-540-36225-8 · Cited by 429
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
Bertsimas, D., & Popescu, I. (2005) · SIAM Journal on Optimization · doi:10.1137/s1052623401399903 · Cited by 428
Duarte, M. F., & Baraniuk, R. G. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.08.003 · Cited by 428
Price-Based Unit Commitment: A Case of Lagrangian Relaxation Versus Mixed Integer Programming
Li, T., & Shahidehpour, M. (2005) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.857391 · Cited by 427
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem
Ostrowski, J., Anjos, M. F., & Vannelli, A. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2162008 · Cited by 424
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
Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability
Hedman, K. W., Ferris, M. C., O'Neill, R. P., Fisher, E. B., & Oren, S. S. (2010) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2009.2037232 · 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
Desrosiers, J., & Lübbecke, M. E. (2006) · Column Generation · doi:10.1007/0-387-25486-2_1 · Cited by 363
Mixed Integer Linear Programming Formulation Techniques
Vielma, J. P. (2015) · SIAM Review · doi:10.1137/130915303 · Cited by 358
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
Learning to Branch in Mixed Integer Programming
Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., & Dilkina, B. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10080 · Cited by 298
Self-citationLogic‐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
A comparison of heuristics and relaxations for the capacitated plant location problem
Cornuejols, G., Sridharan, R., & Thizy, J. M. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90261-s · Cited by 285
Model-Based Decision Support Methodology with Environmental Applications
(2000) · Springer eBooks · doi:10.1007/978-94-015-9552-0 · Cited by 284
School choice with controlled choice constraints: Hard bounds versus soft bounds
Ehlers, L., Hafalir, I. E., Yenmez, M. B., & Yildirim, M. A. (2014) · Journal of Economic Theory · doi:10.1016/j.jet.2014.03.004 · Cited by 283
DISCOVERY OF REGULATORY INTERACTIONS THROUGH PERTURBATION: INFERENCE AND EXPERIMENTAL DESIGN
IDEKER, T. E., THORSSONt, V., & KARP, R. M. (1999) · Biocomputing 2000 · doi:10.1142/9789814447331_0029 · Cited by 274
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
Endogenized technological learning in an energy systems model
Messner, S. (1997) · Journal of Evolutionary Economics · doi:10.1007/s001910050045 · Cited by 258
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Zhu, Z., Tang, J., Lambotharan, S., Chin, W. H., & Fan, Z. (2011) · 2011 IEEE GLOBECOM Workshops (GC Wkshps) · doi:10.1109/glocomw.2011.6162372 · Cited by 157
Electric vehicles charging control in a smart grid: A model predictive control approach
Di Giorgio, A., Liberati, F., & Canale, S. (2014) · Control Engineering Practice · doi:10.1016/j.conengprac.2013.10.005 · Cited by 155
Support Vector Machines with the Ramp Loss and the Hard Margin Loss
Brooks, J. P. (2011) · Operations Research · doi:10.1287/opre.1100.0854 · Cited by 145
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
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Draeger, E. W., Holland, E. T., & Wisnieff, R. (2017) · arXiv · doi:10.48550/arxiv.1710.05867 · Cited by 48
Network control principles for identifying personalized driver genes in cancer
Guo, W.-F., Zhang, S.-W., Zeng, T., Akutsu, T., & Chen, L. (2020) · Briefings in Bioinformatics · doi:10.1093/bib/bbz089 · Cited by 44
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
Satellite image collection optimization
Martin, W. (2002) · Optical Engineering · doi:10.1117/1.1495856 · Cited by 20
Metadata
- Authors
- Williams, H. P., Nemhauser, G. L., & Wolsey, L. A.
- Venue
- Journal of the Operational Research Society
- Publisher
- Palgrave Macmillan
- Published
- 1990-02-01
- Volume
- 41
- Issue
- 2
- Pages
- 177-177
- ISSN
- 0160-5682 (ISSN-L)
- OpenAlex
- W1968143987
- Cited by
- 5,485
- References
- 0
- FWCI
- 77.56
- 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.