A new approach to partial constraint satisfaction problems

DOI10.1080/00207160412331296724zbMath1042.90006OpenAlexW2040975306MaRDI QIDQ4464296

No author found.

Publication date: 27 May 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160412331296724

zbMATH Keywords

simulated annealinggenetic algorithmsresource managementvehicle routing problemstemporal constrainttechnological constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Cites Work

• Branch-and-Bound Methods: A Survey

This page was built for publication: A new approach to partial constraint satisfaction problems