Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
From MaRDI portal
Publication:3392018
Recommendations
Cited in
(only showing first 100 items - show all)- Convexity and optimization with copulæ structured probabilistic constraints
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- On the hop-constrained survivable network design problem with reliable edges
- Stochastic survivable network design problems: theory and practice
- On generating maximal nondominated Benders cuts
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- Single-facility scheduling by logic-based Benders decomposition
- Computing and maximizing the exact reliability of wireless backhaul networks
- The leave-worst-\(k\)-out criterion for cross validation
- A logic-based Benders decomposition for microscopic railway timetable planning
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- The Benders decomposition algorithm: a literature review
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- A Benders decomposition algorithm for the maximum availability service facility location problem
- Exact solution techniques for two-dimensional cutting and packing
- Combinatorial Benders cuts for assembly line balancing problems with setups
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- A nested Benders decomposition approach for telecommunication network planning
- 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 exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds
- On conic QPCCs, conic QCQPs and completely positive programs
- Three modeling paradigms in mathematical programming
- Profit-maximization generation maintenance scheduling through bi-level programming
- Optimizing invasive species management: a mixed-integer linear programming approach
- An almost exact solution to the min completion time variance in a single machine
- The Benders dual decomposition method
- Regularized decomposition of large scale block-structured robust optimization problems
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- An LPCC approach to nonconvex quadratic programs
- Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning
- Optimization approaches to supervised classification
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- Optimizing integrated aircraft assignment and turnaround handling
- Simulation-optimization approaches for water pump scheduling and pipe replacement problems
- Combining Benders decomposition and column generation for multi-activity tour scheduling
- Integer Programming and Combinatorial Optimization
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- Generalized Benders' decomposition for topology optimization problems
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Energy-aware survivable networks
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- 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
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
- 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
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Combinatorial Benders' cuts for the strip packing problem
- 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
- 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
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
- Integer programming models and algorithms for the graph decontamination problem with mobile agents
- Benders decomposition for production routing under demand uncertainty
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- The stop-and-drop problem in nonprofit food distribution networks
- Benders decomposition for capacitated network design
- An exact decomposition approach for the real-time train dispatching problem
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- First-order dominance: stronger characterization and a bivariate checking algorithm
- On the minimum chordal completion polytope
- Flexibility in manufacturing system design: a review of recent approaches from operations research
- Accelerating the Benders decomposition method: application to stochastic network design problems
- Logic-based Benders decomposition for large-scale optimization
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- The last-mile delivery process with trucks and drones under uncertain energy consumption
- Exact reliability optimization for series‐parallel graphs using convex envelopes
- Logic-based Benders decomposition for wildfire suppression
- Multi-period distribution networks with purchase commitment contracts
- A decomposition approach for solving a broadcast domination network design problem
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
- Combinatorial Benders decomposition for the operational aircraft maintenance routing problem
- Theoretical and computational advances for network diversion
- 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
- A compact mixed integer linear formulation for safe set problems
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Team Orienteering with Time-Varying Profit
- An exact method for a last-mile delivery routing problem with multiple deliverymen
- A unified framework for bivariate clustering and regression problems via mixed-integer linear programming
- 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)
