Pages that link to "Item:Q3703656"

The following pages link to Valid Linear Inequalities for Fixed Charge Problems (Q3703656):

Displaying 50 items.

• Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621) (← links)
• Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
• On the transportation problem with market choice (Q479018) (← links)
• Maximum utility product pricing models and algorithms based on reservation price (Q535296) (← links)
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
• LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
• Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
• The convex hull of two core capacitated network design problems (Q689128) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
• SCIP: solving constraint integer programs (Q734351) (← links)
• Primal-dual schema for capacitated covering problems (Q747765) (← links)
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
• Integer-programming software systems (Q817202) (← links)
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• Polyhedral results on single node variable upper-bound flow models with allowed configurations (Q865750) (← links)
• Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
• Chvátal closures for mixed integer programming problems (Q922950) (← links)
• Compact formulations as a union of polyhedra (Q927156) (← links)
• Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
• Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
• Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271) (← links)
• Valid inequalities for mixed 0-1 programs (Q1076609) (← links)
• Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
• Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
• The teacher assignment problem: A special case of the fixed charge transportation problem (Q1278981) (← links)
• Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
• A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
• The complementary class of generalized flow cover inequalities (Q1364783) (← links)
• Lexicographical characterization of the faces of convex sets (Q1384434) (← links)
• New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• Fixed-charge transportation problems on trees (Q1728231) (← links)
• Valid inequalities for the single arc design problem with set-ups (Q1751105) (← links)
• Multi-commodity variable upper bound flow models (Q1751124) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
• Convex hull results for the warehouse problem (Q1756347) (← links)
• A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
• Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
• Cutting-plane proofs in polynomial space (Q1813835) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
• On the facets of the simple plant location packing polytope (Q1850113) (← links)