Pages that link to "Item:Q3392018"
From MaRDI portal
The following pages link to Combinatorial Benders' Cuts for Mixed-Integer Linear Programming (Q3392018):
Displaying 33 items.
- Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem (Q5086007) (← links)
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization (Q5101076) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (Q5129213) (← links)
- The Benders Dual Decomposition Method (Q5130513) (← links)
- Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
- Integer Programming and Combinatorial Optimization (Q5712452) (← links)
- Set covering heuristics in a benders decomposition for railway timetabling (Q6047880) (← links)
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach (Q6048109) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Exact reliability optimization for series‐parallel graphs using convex envelopes (Q6066247) (← links)
- Logic-based Benders decomposition for wildfire suppression (Q6068720) (← links)
- The bus sightseeing problem (Q6080627) (← links)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
- Multi-period distribution networks with purchase commitment contracts (Q6090158) (← links)
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut (Q6096622) (← links)
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers (Q6099415) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
- A unified framework for bivariate clustering and regression problems via mixed-integer linear programming (Q6103471) (← links)
- Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models (Q6106505) (← links)
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
- A traditional Benders' approach to sports timetabling (Q6109825) (← links)
- Extended formulations for perfect domination problems and their algorithmic implications (Q6113358) (← links)
- Optimizing integrated aircraft assignment and turnaround handling (Q6113450) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
- Optimal multivariate decision trees (Q6541864) (← links)
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints (Q6551087) (← links)
- Combinatorial Benders decomposition for the operational aircraft maintenance routing problem (Q6551151) (← links)
- Flexibility in manufacturing system design: a review of recent approaches from operations research (Q6554638) (← links)
- The wildfire suppression problem with multiple types of resources (Q6565388) (← links)
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems (Q6568492) (← links)
- An exact method for a last-mile delivery routing problem with multiple deliverymen (Q6572895) (← links)
