The following pages link to (Q3686494):
Displayed 16 items.
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
- A production planning problem in FMS (Q917423) (← links)
- S3 sets. An extension of the Beale-Tomlin special ordered sets (Q1102852) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- Order selection on a single machine with high set-up costs (Q1309884) (← links)
- Discrete optimization in public rail transport (Q1365068) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
- A computational study of several heuristics for the DRPP (Q1804375) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- Strategies for LP-based solving a general class of scheduling problems (Q3468869) (← links)
- Constraint Generation and Surrogate Relaxation (Q3792483) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)