Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
From MaRDI portal
Publication:3392018
Recommendations
Cited in
(only showing first 100 items - show all)- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- A Benders decomposition-based framework for solving quay crane scheduling problems
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
- Profit-maximization generation maintenance scheduling through bi-level programming
- Multi-period distribution networks with purchase commitment contracts
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
- Logic-based Benders decomposition algorithm for contamination detection problem in water networks
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
- A nested Benders decomposition approach for telecommunication network planning
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- A unified framework for bivariate clustering and regression problems via mixed-integer linear programming
- Logic-based Benders decomposition for large-scale optimization
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- Benders decomposition for capacitated network design
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services
- Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models
- A traditional Benders' approach to sports timetabling
- Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
- Stochastic survivable network design problems: theory and practice
- The last-mile delivery process with trucks and drones under uncertain energy consumption
- Benders decomposition for production routing under demand uncertainty
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- A decomposition approach for solving a broadcast domination network design problem
- Optimal multivariate decision trees
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
- Combinatorial Benders decomposition for the operational aircraft maintenance routing problem
- Accelerating the Benders decomposition method: application to stochastic network design problems
- The multi-period multi-trip container drayage problem with release and due dates
- Computing and maximizing the exact reliability of wireless backhaul networks
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Flexibility in manufacturing system design: a review of recent approaches from operations research
- Exact solution techniques for two-dimensional cutting and packing
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- Regularized decomposition of large scale block-structured robust optimization problems
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- The wildfire suppression problem with multiple types of resources
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- Logic-based Benders decomposition for scheduling a batching machine
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- Generalized Benders' decomposition for topology optimization problems
- Optimizing invasive species management: a mixed-integer linear programming approach
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
- An exact method for a last-mile delivery routing problem with multiple deliverymen
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- A compact mixed integer linear formulation for safe set problems
- Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- First-order dominance: stronger characterization and a bivariate checking algorithm
- Branch and Price for Chance-Constrained Bin Packing
- On conic QPCCs, conic QCQPs and completely positive programs
- Convexity and optimization with copulæ structured probabilistic constraints
- The Benders decomposition algorithm: a literature review
- Three modeling paradigms in mathematical programming
- A Benders decomposition algorithm for the maximum availability service facility location problem
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- The leave-worst-\(k\)-out criterion for cross validation
- Optimizing integrated aircraft assignment and turnaround handling
- Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning
- Identifying relatively irreducible infeasible subsystems of linear inequalities
- Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Mathematical models and decomposition methods for the multiple knapsack problem
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Extended formulations for perfect domination problems and their algorithmic implications
- Team Orienteering with Time-Varying Profit
- Single-facility scheduling by logic-based Benders decomposition
- Set covering heuristics in a benders decomposition for railway timetabling
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
- Optimization approaches to supervised classification
- A noncompact formulation for job-shop scheduling problems in traffic management
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- The multiple multidimensional knapsack with family-split penalties
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- An almost exact solution to the min completion time variance in a single machine
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
- Matheuristics: survey and synthesis
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
- Simulation-optimization approaches for water pump scheduling and pipe replacement problems
- Integer programming models and algorithms for the graph decontamination problem with mobile agents
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
- A Benders decomposition-based approach for logistics service network design
This page was built for publication: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392018)
