Combinatorial optimization: current successes and directions for the future
From MaRDI portal
Publication:1593834
Recommendations
Cites work
- A Computational Study of Search Strategies for Mixed Integer Programming
- 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
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Bounds on optimal values in stochastic scheduling
- Disjunctive programming: Properties of the convex hull of feasible points
- Gomory cuts revisited
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
- scientific article; zbMATH DE number 46734 (Why is no real title available?)
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 680242 (Why is no real title available?)
- scientific article; zbMATH DE number 976922 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Large-scale 0-1 linear programming on distributed workstations
- Linear optimization and extensions
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- MINTO, a Mixed INTeger Optimizer
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
- Optimization Case Studies in the NEOS Guide
- Pivot and Complement–A Heuristic for 0-1 Programming
- Presolving in linear programming
- Stochastic Network Programming for Financial Planning Problems
Cited in
(6)- A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds
- Large scale combinatorial optimization: A methodological viewpoint
- A discrete meta-control procedure for approximating solutions to binary programs
- Renovation of the cutting stock process
- On the History of Combinatorial Optimization (Till 1960)
- Title not available (Why is no real title available?)
This page was built for publication: Combinatorial optimization: current successes and directions for the future
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593834)