Pages that link to "Item:Q5202509"

The following pages link to Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems (Q5202509):

Displaying 47 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)
• SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression (Q319716) (← links)
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
• RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
• The multi-story space assignment problem (Q610966) (← links)
• Mixed-integer bilinear programming problems (Q687032) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← 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)
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← 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)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• Lower and upper bounds for linear production games (Q1027527) (← links)
• A new global approach for \(0\)-\(1\) polynomial programs (Q1317077) (← links)
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
• A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
• On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes (Q1876186) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
• Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor (Q2076863) (← links)
• The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← 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)
• A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning (Q2426672) (← links)
• A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
• A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem (Q2815440) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
• Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)
• Multi-objective mathematical programming for optimally sizing and managing battery energy storage for solar photovoltaic system integration of a multi-apartment building (Q6048107) (← links)
• Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
• An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)
• Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)