Pages that link to "Item:Q1025992"
From MaRDI portal
The following pages link to Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992):
Displaying 24 items.
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- 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)
- A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- A simple recipe for concise mixed 0-1 linearizations (Q1886797) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- Solving multistatic sonar location problems with mixed-integer programming (Q2303531) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Compact linearization for binary quadratic problems (Q2477615) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization (Q3470249) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization (Q4012442) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)