Hybrid Benders decomposition algorithms in constraint logic programming

DOI10.1007/3-540-45578-7_1MaRDI QIDQ4475617zbMATH OpenFDO

Authors Andrew Eremin, Mark Wallace

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390001.htm

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05)

Recommendations

• Integrating Benders Decomposition Within Constraint Programming
• Logic-based Benders decomposition
• Recent Advances in Constraints
• Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming
• Improving Benders decomposition using a genetic algorithm

Cited in

(15)

• Improving Benders decomposition using a genetic algorithm
• Logic-based Benders decomposition
• The Benders decomposition algorithm: a literature review
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
• A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
• Integrating Benders Decomposition Within Constraint Programming
• Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming
• scientific article; zbMATH DE number 5584354 (Why is no real title available?)
• Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
• A hybrid method for the planning and scheduling
• An integrated method for planning and scheduling to minimize tardiness
• Analysis of decomposition algorithms with Benders cuts for p-median problem
• Scheduling and routing of automated guided vehicles: A hybrid approach

Describes a project that uses

Uses Software

• TSPTW

This page was built for publication: Hybrid Benders decomposition algorithms in constraint logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475617)