Combinatorial optimization: current successes and directions for the future
From MaRDI portal
Publication:1593834
DOI10.1016/S0377-0427(00)00430-1zbMath1107.90432MaRDI QIDQ1593834
Publication date: 25 January 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Heuristics; Parallel processing; Cutting planes; Hybrid algorithms; Column-generation; Modeling languages and stochastic optimization; Problem formulation; Solution analysis
90C27: Combinatorial optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large-scale 0-1 linear programming on distributed workstations
- Disjunctive programming: Properties of the convex hull of feasible points
- A computer-assisted analysis system for mathematical programming models and solutions. A user's guide for ANALYZE. Incl. 1 disk
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- MINTO, a Mixed INTeger Optimizer
- Bounds on optimal values in stochastic scheduling
- Linear optimization and extensions
- Presolving in linear programming
- Gomory cuts revisited
- Pivot and Complement–A Heuristic for 0-1 Programming
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Stochastic Network Programming for Financial Planning Problems
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Optimization Case Studies in the NEOS Guide
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- A Computational Study of Search Strategies for Mixed Integer Programming
