Pages that link to "Item:Q1329799"
From MaRDI portal
The following pages link to A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799):
Displaying 50 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Optimization models for a single-plant district cooling system (Q320055) (← links)
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- A two-level location-allocation problem in designing local access fiber optic networks (Q337111) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Manifold relaxations for integer programming (Q380594) (← links)
- The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning (Q613606) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
- A global optimization RLT-based approach for solving the fuzzy clustering problem (Q816063) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications (Q817182) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Composite-variable modeling for service parts logistics (Q867536) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← 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)
- Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon (Q1688448) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- Robust multicriteria risk-averse stochastic programming models (Q1698287) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
