Efficient filtering for the resource-cost alldifferent constraint

DOI10.1007/s10601-017-9269-yzbMath1387.90148OpenAlexW2618870441MaRDI QIDQ1701236

Pierre Schaus, Sascha van Cauwelaert

Publication date: 22 February 2018

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-017-9269-y

zbMATH Keywords

energyschedulingscalabilityfilteringresourcealldifferentassignment costproduct matrix travelling salesman problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Uses Software

• CSPLib
• Concorde
• OscaR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transforming asymmetric into symmetric traveling salesman problems
• Cost-based arc consistency for global cardinality constraints
• The item dependent stockingcost constraint
• Solving TSP through the Integration of OR and CP Techniques
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• Forward-Checking Filtering for Nested Cardinality Constraints: Application to an Energy Cost-Aware Production Planning Problem for Tissue Manufacturing
• The TaskIntersection Constraint
• A Resource Cost Aware Cumulative
• The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Understanding the Potential of Propagators
• Benchmarking optimization software with performance profiles.

This page was built for publication: Efficient filtering for the resource-cost alldifferent constraint