Combinatorial auctions using rule-based bids
Decision Support Systems
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
Computational Optimization and Applications
A simplex-based algorithm for 0-1 mixed integer programming
Combinatorial optimization - Eureka, you shrink!
A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions
INFORMS Journal on Computing
Sequential-Merge Facets for Two-Dimensional Group Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms
INFORMS Journal on Computing
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
Loosely coupled formulations for automated planning: an integer programming perspective
Journal of Artificial Intelligence Research
Efficient preprocessing for VLSI optimization problems
Computational Optimization and Applications
Automatic range image registration using mixed integer linear programming
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Towards transparent personal content storage in multi-service access networks
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Computers and Operations Research
The Chvátal-Gomory Closure of a Strictly Convex Body
Mathematics of Operations Research
Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study
INFORMS Journal on Computing
On Maximal $S$-Free Convex Sets
SIAM Journal on Discrete Mathematics
Can dynamic neural filters produce pseudo-random sequences?
ICANN'05 Proceedings of the 15th international conference on Artificial Neural Networks: biological Inspirations - Volume Part I
Compositional derivation of symmetries for constraint satisfaction
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
New linearizations of quadratic assignment problems
Computers and Operations Research
| Hi-index | 0.00 |
This paper is about modeling and solving mixed integer programming (MIP) problems. In the last decade, the use of mixed integer programming models has increased dramatically. Fifteen years ago, mainframe computers were required to solve problems with a hundred integer variables. Now it is possible to solve problems with thousands of integer variables on a personal computer and obtain provably good approximate solutions to problems such as set partitioning with millions of binary variables. These advances have been made possible by developments in modeling, algorithms, software, and hardware. This paper focuses on effective modeling, preprocessing, and the methodologies of branch-and-cut and branch-and-price, which are the techniques that make it possible to treat problems with either a very large number of constraints or a very large number of variables. We show how these techniques are useful in important application areas such as network design and crew scheduling. Finally, we discuss the relatively new research areas of parallel integer programming and stochastic integer programming.