Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

DOI10.1287/OPRE.1060.0286zbMATH Open1167.90601OpenAlexW2124947072MaRDI QIDQ3392018FDOQ3392018

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

Recommendations

• Integer Programming and Combinatorial Optimization
• The Benders dual decomposition method
• Implementing automatic benders decomposition in a modern MIP solver
• Computational Integer Programming and Cutting Planes
• MIP: Theory and practice -- closing the gap

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• Computing and maximizing the exact reliability of wireless backhaul networks
• Exact solution techniques for two-dimensional cutting and packing
• Benders Decomposition for Capacitated Network Design
• Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• 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
• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• 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
• A nested benders decomposition approach for telecommunication network planning
• Optimizing invasive species management: a mixed-integer linear programming approach
• Generalized Benders' decomposition for topology optimization problems
• Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
• Logic based Benders' decomposition for orthogonal stock cutting problems
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• First-order dominance: stronger characterization and a bivariate checking algorithm
• Convexity and optimization with copulæ structured probabilistic constraints
• The Benders decomposition algorithm: a literature review
• A Benders decomposition algorithm for the maximum availability service facility location problem
• On conic QPCCs, conic QCQPs and completely positive programs
• Three modeling paradigms in mathematical programming
• Optimizing integrated aircraft assignment and turnaround handling
• The leave-worst-\(k\)-out criterion for cross validation
• Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
• The Benders Dual Decomposition Method
• Benders Decomposition for Production Routing Under Demand Uncertainty
• Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning
• 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
• Single-facility scheduling by logic-based Benders decomposition
• Optimization approaches to supervised classification
• 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
• Integer programming models and algorithms for the graph decontamination problem with mobile agents
• On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
• Simulation-optimization approaches for water pump scheduling and pipe replacement problems
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
• A branch-and-check approach for a wind turbine maintenance scheduling problem
• Branch-and-cut methods for the network design problem with vulnerability constraints
• An LPCC approach to nonconvex quadratic programs
• Integer Programming and Combinatorial Optimization
• Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
• Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
• Energy-aware survivable networks
• On generating maximal nondominated Benders cuts
• Combinatorial Benders cuts for assembly line balancing problems with setups
• A logic-based Benders decomposition for microscopic railway timetable planning
• On interval-subgradient and no-good cuts
• 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
• Combining Benders decomposition and column generation for multi-activity tour scheduling
• The stop-and-drop problem in nonprofit food distribution networks
• On the hop-constrained survivable network design problem with reliable edges
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
• A Benders decomposition-based framework for solving quay crane scheduling problems
• Profit-maximization generation maintenance scheduling through bi-level programming
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Combinatorial Benders' Cuts for the Strip Packing Problem
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
• An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
• Stochastic survivable network design problems: theory and practice
• Benders' cuts guided large neighborhood search for the traveling umpire problem
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
• Flexibility in manufacturing system design: a review of recent approaches from operations research
• A framework for generalized Benders' decomposition and its application to multilevel optimization
• Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling
• The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
• Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem
• 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 Large-Scale Optimization
• Logic-based Benders decomposition for scheduling a batching machine
• A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
• An exact method for a last-mile delivery routing problem with multiple deliverymen
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
• Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
• Title not available (Why is that?)
• A compact mixed integer linear formulation for safe set problems
• The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
• Branch and Price for Chance-Constrained Bin Packing
• 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
• Extended formulations for perfect domination problems and their algorithmic implications
• Team Orienteering with Time-Varying Profit
• 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
• 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
• Matheuristics: survey and synthesis

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)