Pages that link to "Item:Q3762072"

The following pages link to A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (Q3762072):

Displaying 50 items.

• Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
• The generalized vertex cover problem and some variations (Q1756348) (← links)
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
• An integer linear programming approach for a class of bilinear integer programs (Q1785220) (← links)
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
• Tighter representations for set partitioning problems (Q1917353) (← links)
• An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
• The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
• Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
• Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
• Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
• The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• A neurodynamic approach to zero-one quadratic programming (Q2234482) (← links)
• Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
• Convex hull representations of special monomials of binary variables (Q2311191) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
• An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
• Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
• Compact linearization for binary quadratic problems (Q2477615) (← links)
• Restricted risk measures and robust optimization (Q2629722) (← links)
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
• Global optimization of a quadratic function subject to a bounded mixed integer constraint set (Q2640438) (← links)
• An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
• Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
• Integer programming approaches to the multiple team formation problem (Q2668786) (← links)
• Wave order picking under the mixed-shelves storage strategy: a solution method and advantages (Q2669653) (← links)
• A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Mixed integer linear programming formulation techniques (Q2808240) (← links)
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
• A mixed integer quadratic programming model for the low autocorrelation binary sequence problem (Q2871019) (← links)
• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573) (← links)
• SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
• Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• Linear Reformulations of Integer Quadratic Programs (Q3627671) (← links)
• On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)