Combinatorial optimization: current successes and directions for the future

DOI10.1016/S0377-0427(00)00430-1zbMath1107.90432WikidataQ127907957 ScholiaQ127907957MaRDI QIDQ1593834

Karla L. Hoffman

Publication date: 25 January 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

HeuristicsParallel processingCutting planesHybrid algorithmsColumn-generationModeling languages and stochastic optimizationProblem formulationSolution analysis

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

A discrete meta-control procedure for approximating solutions to binary programs, Renovation of the cutting stock process, A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds

Uses Software

• AMPL
• CPLEX
• MINTO
• AIMMS
• GAMS
• Tabu search

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