Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- A local search enhanced logic-based benders decomposition approach for order acceptance and scheduling problem with preemption
- 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
- Last fifty years of integer linear programming: a focus on recent practical advances
- Resilient transportation network design with disruption uncertainty and lead times
- A tight formulation for the dial-a-ride problem
- An exact method for trilevel hub location problem with interdiction
- An exact method for a last-mile delivery routing problem with multiple deliverymen
- Mixed-model sequencing with stochastic failures: a case study for automobile industry
- Stable set reformulations for the degree preserving spanning tree problem
- Benders decomposition with delayed disaggregation for the active passive vehicle routing problem
- A generalized Benders decomposition approach for the optimal design of a local multi-energy system
- Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints
- 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
- On a fair and risk-averse urban air mobility resource allocation problem under demand and capacity uncertainties
- 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
- An LPCC approach to nonconvex quadratic programs
- A branch-and-check approach for a wind turbine maintenance scheduling problem
- Branch-and-cut methods for the network design problem with vulnerability constraints
- A decomposition approach for multidimensional knapsacks with family‐split penalties
- A survey of network interdiction models and algorithms
- Exact reliability optimization for series‐parallel graphs using convex envelopes
- Logic-based Benders decomposition for wildfire suppression
- 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
- Integer Programming and Combinatorial Optimization
- Energy-aware survivable networks
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Benders decomposition: solving binary master problems by enumeration
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- Combinatorial Benders cuts for assembly line balancing problems with setups
- On generating maximal nondominated Benders cuts
- Combinatorial Benders' cuts for the strip packing problem
- An exact decomposition approach for the real-time train dispatching problem
- A logic-based Benders decomposition for microscopic railway timetable planning
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
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)
