Pages that link to "Item:Q2458902"
From MaRDI portal
The following pages link to An improved linearization strategy for zero-one quadratic programming problems (Q2458902):
Displayed 20 items.
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
- Large margin shortest path routing (Q694164) (← links)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
- Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
- Stochastic single-allocation hub location (Q2029287) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Shortest paths with exclusive-disjunction arc pairs conflicts (Q6164356) (← links)