Building negative reduced cost paths using constraint programming

DOI10.1007/3-540-45578-7_78MaRDI QIDQ4735927zbMATH OpenFDO

Authors Louis-Martin Rousseau, Gilles Pesant, Michel Gendreau

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/22390778.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35)

Recommendations

• On the shortest path problem with negative cost cycles
• Constraint programming: strategic directions
• Computing constrained shortest-paths at scale
• scientific article; zbMATH DE number 3847193
• Constraint-based local search for constrained optimum paths problems
• Constraint programming techniques for solving problems on graphs

Cited in

(2)

• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• A simple perspective on simultaneous column and row generation

This page was built for publication: Building negative reduced cost paths using constraint programming

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