scientific article; zbMATH DE number 3908160
From MaRDI portal
Publication:3686494
Recommendations
- Polyhedral techniques in combinatorial optimization I: Theory
- Advances in Combinatorial Optimization
- On a linear-programming, combinatorial approach to the traveling-salesman problem
- Linear complementarity as a general solution method to combinatorial problems
- Expressing combinatorial optimization problems by linear programs
Cited in
(18)- S3 sets. An extension of the Beale-Tomlin special ordered sets
- Strong formulations for mixed integer programming: A survey
- An analytical comparison of different formulations of the travelling salesman problem
- Order selection on a single machine with high set-up costs
- Discrete optimization in public rail transport
- Some properties of cliques in 0-1 mixed integer programs
- A computational study of several heuristics for the DRPP
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- Facets and algorithms for capacitated lot sizing
- Nonconvex optimization over a polytope using generalized capacity improvement
- Strategies for LP-based solving a general class of scheduling problems
- Constraint Generation and Surrogate Relaxation
- Sparktope: linear programs from algorithms
- Classical cuts for mixed-integer programming and branch-and-cut
- Principles and Practice of Constraint Programming – CP 2004
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A production planning problem in FMS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686494)
