Pages that link to "Item:Q3762072"
From MaRDI portal
The following pages link to A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (Q3762072):
Displaying 50 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- 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)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792) (← links)
- Bivalent quadratic programming problem - A computational study (Q801811) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Location coverage models with demand originating from nodes and paths: Application to cellular network design (Q928021) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Linearization of a 0-1 quadratic fractional programming problem (Q998699) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
- A mathematical program to refine gene regulatory networks (Q1026217) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- A solvable class of quadratic 0-1 programming (Q1193723) (← links)
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
- A distance assignment approach to the facility layout problem (Q1197697) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← links)
- An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- On a linearization technique for solving the quadratic set covering problem and variations (Q1676486) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
