Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- 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
- 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
- Profit-maximization generation maintenance scheduling through bi-level programming
- First-order dominance: stronger characterization and a bivariate checking algorithm
- Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
- Computing and maximizing the exact reliability of wireless backhaul networks
- 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
- Mathematical models and decomposition methods for the multiple knapsack problem
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- Benders decomposition: solving binary master problems by enumeration
- Regularized decomposition of large scale block-structured robust optimization problems
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling
- Exact solution techniques for two-dimensional cutting and packing
- 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
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- A Benders decomposition algorithm for the maximum availability service facility location problem
- 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
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot
- A logic-based Benders decomposition for microscopic railway timetable planning
- Shattering inequalities for learning optimal decision trees
- A Benders decomposition-based approach for logistics service network design
- A compact mixed integer linear formulation for safe set problems
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- 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
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- 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
- Logic-based Benders decomposition for scheduling a batching machine
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- 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
- 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
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- 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
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
- The leave-worst-k-out criterion for cross validation
- Theoretical and computational advances for network diversion
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
- Convexity and optimization with copulæ structured probabilistic constraints
- 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
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- Combinatorial Benders' cuts for the strip packing problem
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- On conic QPCCs, conic QCQPs and completely positive programs
- An exact decomposition approach for the real-time train dispatching problem
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- Simulation-optimization approaches for water pump scheduling and pipe replacement problems
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Energy-aware survivable networks
- Logic-based Benders decomposition for large-scale optimization
- 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
- Branch and Price for Chance-Constrained Bin Packing
- On the hop-constrained survivable network design problem with reliable edges
- Benders decomposition for production routing under demand uncertainty
- A nested Benders decomposition approach for telecommunication network planning
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- An LPCC approach to nonconvex quadratic programs
- Accelerating the Benders decomposition method: application to stochastic network design problems
- The stop-and-drop problem in nonprofit food distribution networks
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- 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
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization
- On the minimum chordal completion polytope
- A noncompact formulation for job-shop scheduling problems in traffic management
- The Benders dual decomposition method
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)
