Pages that link to "Item:Q2467302"
From MaRDI portal
The following pages link to Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302):
Displaying 22 items.
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems (Q620017) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages (Q2669653) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (Q3762072) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)