Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

DOI10.1287/opre.1060.0286zbMath1167.90601OpenAlexW2124947072MaRDI QIDQ3392018

Matteo Fischetti, Gianni Codato

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1060.0286

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, A Benders decomposition-based framework for solving quay crane scheduling problems, Benders' cuts guided large neighborhood search for the traveling umpire problem, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, On conic QPCCs, conic QCQPs and completely positive programs, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, An exact algorithm for the static rebalancing problem arising in bicycle sharing systems, Simulation-optimization approaches for water pump scheduling and pipe replacement problems, 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 branch-and-Benders-cut method for nonlinear power design in green wireless local area networks, Energy-aware survivable networks, New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot, Benders Decomposition for Production Routing Under Demand Uncertainty, Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures, A mixed integer programming approach for the single machine problem with unequal release dates, A combinatorial Benders' decomposition for the lock scheduling problem, A branch-and-check approach for a wind turbine maintenance scheduling problem, Logic based Benders' decomposition for orthogonal stock cutting problems, Branch-and-cut methods for the network design problem with vulnerability constraints, Combining Benders decomposition and column generation for multi-activity tour scheduling, Solving a selective dial-a-ride problem with logic-based Benders decomposition, A logic-based Benders decomposition for microscopic railway timetable planning, On the hop-constrained survivable network design problem with reliable edges, An Exact Decomposition Approach for the Real-Time Train Dispatching Problem, Shattering inequalities for learning optimal decision trees, Combinatorial Benders' Cuts for the Strip Packing Problem, Team Orienteering with Time-Varying Profit, Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, The multi-period multi-trip container drayage problem with release and due dates, The last-mile delivery process with trucks and drones under uncertain energy consumption, Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem, Three modeling paradigms in mathematical programming, A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem, Profit-maximization generation maintenance scheduling through bi-level programming, On interval-subgradient and no-good cuts, A Benders decomposition-based approach for logistics service network design, Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling, A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support, An LPCC approach to nonconvex quadratic programs, The leave-worst-\(k\)-out criterion for cross validation, On generating maximal nondominated Benders cuts, Single-facility scheduling by logic-based Benders decomposition, A decomposition approach for solving a broadcast domination network design problem, First-order dominance: stronger characterization and a bivariate checking algorithm, Generalized Benders' decomposition for topology optimization problems, Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints, Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness, The stop-and-drop problem in nonprofit food distribution networks, Logic-Based Benders Decomposition for Large-Scale Optimization, A compact mixed integer linear formulation for safe set problems, The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms, Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Computing and maximizing the exact reliability of wireless backhaul networks, An almost exact solution to the min completion time variance in a single machine, Identifying relatively irreducible infeasible subsystems of linear inequalities, Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand, Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions, The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT), Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling, Optimizing invasive species management: a mixed-integer linear programming approach, Combinatorial Benders cuts for assembly line balancing problems with setups, The Benders decomposition algorithm: a literature review, Stochastic survivable network design problems: theory and practice, Optimization approaches to supervised classification, Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem, Projected Chvátal-Gomory cuts for mixed integer linear programs, Mathematical models and decomposition methods for the multiple knapsack problem, A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning, A nested benders decomposition approach for telecommunication network planning, Exact solution algorithms for the maximum flow problem with additional conflict constraints, Benders decomposition: solving binary master problems by enumeration, Accelerating Benders decomposition for short-term hydropower maintenance scheduling, Exact solution techniques for two-dimensional cutting and packing, IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation, The multiple multidimensional knapsack with family-split penalties, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions, An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability, Benders' decomposition for the balancing of assembly lines with stochastic demand, Regularized decomposition of large scale block-structured robust optimization problems, Logic-based Benders decomposition algorithm for contamination detection problem in water networks, A branch-and-Benders-cut approach for the fault tolerant regenerator location problem, A survey of network interdiction models and algorithms, Theoretical and computational advances for network diversion, Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments, A Benders approach for computing lower bounds for the mirrored traveling tournament problem, Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds, Convexity and optimization with copulæ structured probabilistic constraints, Branch and Price for Chance-Constrained Bin Packing, On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs, Benders Decomposition for Capacitated Network Design, Logic-based Benders decomposition for scheduling a batching machine, A framework for generalized Benders' decomposition and its application to multilevel optimization, A Benders decomposition algorithm for the maximum availability service facility location problem, Integer programming models and algorithms for the graph decontamination problem with mobile agents, Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem, Symmetry-driven network reconstruction through pseudobalanced coloring optimization, 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, Matheuristics: survey and synthesis, Exact reliability optimization for series‐parallel graphs using convex envelopes, Logic-based Benders decomposition for wildfire suppression, The bus sightseeing problem, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems, Multi-period distribution networks with purchase commitment contracts, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers, Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition, A unified framework for bivariate clustering and regression problems via mixed-integer linear programming, Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models, A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services, A traditional Benders' approach to sports timetabling, Extended formulations for perfect domination problems and their algorithmic implications, Optimizing integrated aircraft assignment and turnaround handling, A decomposition approach for multidimensional knapsacks with family‐split penalties, A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, The Benders Dual Decomposition Method, Unnamed Item