Pages that link to "Item:Q1886797"

The following pages link to A simple recipe for concise mixed 0-1 linearizations (Q1886797):

Displaying 26 items.

• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
• An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
• Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• Wildfire fuel management: network-based models and optimization of prescribed burning (Q1681542) (← links)
• A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
• Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
• Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
• Solving multistatic sonar location problems with mixed-integer programming (Q2303531) (← links)
• An alternative efficient representation for the project portfolio selection problem (Q2329483) (← links)
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
• Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
• Performance safety enforcement in stochastic event graphs against boost and slow attacks (Q2665315) (← links)
• A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey (Q2691459) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
• SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
• Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
• An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
• On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• The Bipartite QUBO (Q5050150) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)