Pages that link to "Item:Q1329799"

The following pages link to A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799):

Displaying 50 items.

• Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
• A study of general and security Stackelberg game formulations (Q1999631) (← links)
• An optimal data-splitting algorithm for aircraft sequencing on a single runway (Q2070768) (← links)
• Strategic bidding in price coupled regions (Q2155379) (← links)
• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
• Product assortment and space allocation strategies to attract loyal and non-loyal customers (Q2184066) (← links)
• Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
• Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
• Convex hull representations of special monomials of binary variables (Q2311191) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• A global optimization algorithm for reliable network design (Q2379515) (← 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)
• Two-stage stochastic hierarchical multiple risk problems: Models and algorithms (Q2390998) (← links)
• Configuration of airspace sectors for balancing air traffic controller workload (Q2393463) (← links)
• A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
• A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
• A decomposition approach to the two-stage stochastic unit commitment problem (Q2442096) (← links)
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
• A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
• A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
• Cuts for mixed 0-1 conic programming (Q2571004) (← links)
• A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← 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)
• The cutting plane method is polynomial for perfect matchings (Q2800362) (← links)
• Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
• Using \(\mathrm{DRL}^*\) relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut (Q2861558) (← links)
• Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem (Q2940539) (← links)
• Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
• A<i>p</i>-cone sequential relaxation procedure for 0-1 integer programs (Q3396384) (← links)
• Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
• Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• A novel modeling approach for express package carrier planning (Q3627939) (← links)
• Branch and bound for piecewise linear neural network verification (Q4969086) (← links)
• The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
• Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics (Q5085987) (← links)
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
• Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
• BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)