Pages that link to "Item:Q817200"
From MaRDI portal
The following pages link to A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200):
Displaying 22 items.
- Optimal mapping of cloud virtual machines (Q325399) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization (Q2127089) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem (Q2691902) (← links)
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems (Q2770136) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← 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)
