Pages that link to "Item:Q1352556"

The following pages link to Location, scheduling, design and integer programming (Q1352556):

Displaying 22 items.

• Selected topics on assignment problems (Q697571) (← links)
• GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• The service allocation problem at the Gioia Tauro maritime terminal (Q852990) (← links)
• Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
• Counting the solutions of Presburger equations without enumerating them. (Q1426156) (← links)
• Approximating separable nonlinear functions via mixed zero-one programs (Q1591598) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
• A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
• Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• Models and solution techniques for production planning problems with increasing byproducts (Q2250099) (← links)
• Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
• Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
• Compact linearization for binary quadratic problems (Q2477615) (← links)
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes (Q4972544) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
• The QAP-polytope and the star transformation (Q5939231) (← links)