Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming
From MaRDI portal
Cites work
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- A heuristic search approach to planning with temporally extended preferences
- A logic-based Benders decomposition for microscopic railway timetable planning
- A regularized decomposition method for minimizing a sum of polyhedral functions
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A survey on problems and methods in generalized assembly line balancing
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- Combinatorial Benders cuts for assembly line balancing problems with setups
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Combining optimisation and simulation using logic-based Benders decomposition
- Decomposition algorithms for stochastic programming on a computational grid
- Decomposition methods for the parallel machine scheduling problem with setups
- Deepest cuts for Benders decomposition
- Domain-independent dynamic programming and constraint programming approaches for assembly line balancing problems with setups
- Improved integer programming models for simple assembly line balancing and related problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Logic-based Benders decomposition
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Network Migration Problem: A Hybrid Logic-Based Benders Decomposition Approach
- New formulations for the setup assembly line balancing and scheduling problem
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Planning and Scheduling by Logic-Based Benders Decomposition
- Principles and Practice of Constraint Programming – CP 2004
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
- Single-facility scheduling by logic-based Benders decomposition
- Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- The Benders decomposition algorithm: a literature review
This page was built for publication: Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308967)
