Logic-Based Benders Decomposition for Large-Scale Optimization
From MaRDI portal
Publication:3296379
DOI10.1007/978-3-030-22788-3_1zbMath1446.90108arXiv1910.11944OpenAlexW2971583140MaRDI QIDQ3296379
Publication date: 7 July 2020
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.11944
Large-scale problems in mathematical programming (90C06) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items
Stochastic Planning and Scheduling with Logic-Based Benders Decomposition, Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms, Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem, Assembly planning by disjunctive programming and geometrical reasoning, Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling, Logic-based Benders decomposition for wildfire suppression, Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition, Combining optimisation and simulation using logic-based Benders decomposition, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, The two-echelon stochastic multi-period capacitated location-routing problem, Exact optimization and decomposition approaches for shelf space allocation, Strengthening of feasibility cuts in logic-based benders decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- A combinatorial Benders' decomposition for the lock scheduling problem
- An LPCC approach to nonconvex quadratic programs
- The stop-and-drop problem in nonprofit food distribution networks
- Optimal resource allocation and scheduling for the CELL BE platform
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
- Integrated methods for optimization
- Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
- Solving an integrated job-shop problem with human resource constraints
- A hybrid method for the planning and scheduling
- An integrated method for planning and scheduling to minimize tardiness
- Integrated methods for optimization.
- A Benders approach for the constrained minimum break problem
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- Cutting plane algorithms for solving a stochastic edge-partition problem
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Modelling and solving the senior transportation problem
- A branch-and-check approach for a wind turbine maintenance scheduling problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- 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 approach to improve coordination of inland vessels for inter-terminal transport
- A Benders decomposition approach to deciding modular linear integer arithmetic
- The Benders decomposition algorithm: a literature review
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Solving planning and scheduling problems with combined integer and constraint programming
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- On convex quadratic programs with linear complementarity constraints
- Single-facility scheduling by logic-based Benders decomposition
- A decomposition approach for solving a broadcast domination network design problem
- Scheduling a triple round robin tournament for the best Danish soccer league
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Two-level decomposition algorithm for crew rostering problems with fair working condition
- Generalized Benders decomposition
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
- Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
- Robust Scheduling with Logic-Based Benders Decomposition
- Logic-Based Decomposition Methods for the Travelling Purchaser Problem
- Scheduling Home Hospice Care with Logic-Based Benders Decomposition
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- A Constraint Programming Approach for Solving a Queueing Design and Control Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
- An Integrated Solver for Optimization Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
- Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
- Logic-based MultiObjective Optimization for Restoration Planning
- Inexact Cuts in Benders Decomposition
- A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem
- Collaborative Operating Room Planning and Scheduling
- Optimal Torpedo Scheduling
- Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
- Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
- Optimization Bounds from the Branching Dual
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A Benders Approach to the Minimum Chordal Completion Problem
- Recent Advances in Constraints
- Principles and Practice of Constraint Programming – CP 2004
