Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Logic-Based Benders Decomposition for Large-Scale Optimization	scientific article

Statements

scholarly article

0 references

Logic-Based Benders Decomposition for Large-Scale Optimization (English)

0 references

Springer Optimization and Its Applications

0 references

publication date

7 July 2020

0 references

full work available at URL

https://arxiv.org/abs/1910.11944

0 references

zbMATH Keywords

basic theory

0 references

branch and check

0 references

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs

0 references

On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs

0 references

On convex quadratic programs with linear complementarity constraints

0 references

Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources

0 references

A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines

0 references

Constraint-based scheduling: Applying constraint programming to scheduling problems.

0 references

A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems

0 references

0 references

Partitioning procedures for solving mixed-variables programming problems

0 references

Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation

0 references

Multi-stage Benders Decomposition for Optimizing Multicore Architectures

0 references

Optimal resource allocation and scheduling for the CELL BE platform

0 references

A Benders Approach to the Minimum Chordal Completion Problem

0 references

Logic-Based Decomposition Methods for the Travelling Purchaser Problem

0 references

Local search and constraint programming for the post enrolment-based course timetabling problem

0 references

Principles and Practice of Constraint Programming – CP 2004

0 references

Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition

0 references

Single-facility scheduling by logic-based Benders decomposition

0 references

A Benders approach for computing lower bounds for the mirrored traveling tournament problem

0 references

A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems

0 references

Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling

0 references

Robust Scheduling with Logic-Based Benders Decomposition

0 references

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Combinatorial Benders' Cuts for the Strip Packing Problem

0 references

Logic based Benders' decomposition for orthogonal stock cutting problems

0 references

Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem

0 references

A branch-and-check approach for a wind turbine maintenance scheduling problem

0 references

Optimization Bounds from the Branching Dual

0 references

A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks

0 references

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem

0 references

Generalized Benders decomposition

0 references

Optimal Torpedo Scheduling

0 references

Logic-based MultiObjective Optimization for Restoration Planning

0 references

Solving an integrated job-shop problem with human resource constraints

0 references

Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags

0 references

Scheduling Home Hospice Care with Logic-Based Benders Decomposition

0 references

0 references

A hybrid method for the planning and scheduling

0 references

An integrated method for planning and scheduling to minimize tardiness

0 references

Integrated methods for optimization.

0 references

Planning and Scheduling by Logic-Based Benders Decomposition

0 references

Integrated methods for optimization

0 references

Logic-based Benders decomposition

0 references

An LPCC approach to nonconvex quadratic programs

0 references

On the Global Solution of Linear Programs with Linear Complementarity Constraints

0 references

A Benders decomposition approach to deciding modular linear integer arithmetic

0 references

A logic-based Benders decomposition approach to improve coordination of inland vessels for inter-terminal transport

0 references

Modelling and solving the senior transportation problem

0 references

Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem

0 references

A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles

0 references

Two-level decomposition algorithm for crew rostering problems with fair working condition

0 references

The Benders decomposition algorithm: a literature review

0 references

Boosting an exact logic-based Benders decomposition approach by variable neighborhood search

0 references

Scheduling a triple round robin tournament for the best Danish soccer league

0 references

A Benders approach for the constrained minimum break problem

0 references

Combining Benders decomposition and column generation for multi-activity tour scheduling

0 references

Solving a selective dial-a-ride problem with logic-based Benders decomposition

0 references

Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling

0 references

Collaborative Operating Room Planning and Scheduling

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates

0 references

A decomposition approach for solving a broadcast domination network design problem

0 references

The stop-and-drop problem in nonprofit food distribution networks

0 references

Cutting plane algorithms for solving a stochastic edge-partition problem

0 references

Recent Advances in Constraints

0 references

A Constraint Programming Approach for Solving a Queueing Design and Control Problem

0 references

0 references

Solving planning and scheduling problems with combined integer and constraint programming

0 references

Decomposition Methods for the Parallel Machine Scheduling Problem with Setups

0 references

0 references

Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem

0 references

Benders' cuts guided large neighborhood search for the traveling umpire problem

0 references

A combinatorial Benders' decomposition for the lock scheduling problem

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

An Integrated Solver for Optimization Problems

0 references

Inexact Cuts in Benders Decomposition

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-22788-3_1

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3296379

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3296379&oldid=36598477"