scientific article
From MaRDI portal
Publication:3378422
zbMath1101.90014MaRDI QIDQ3378422
Publication date: 31 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
vehicle routinghit-and-rungreedy heuristicimproving hit-and-runpure random searchbranch and cut algorithmsnearest neighbour heuristictraveling Salesman problems
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items (2)
A set partitioning reformulation of a school bus scheduling problem ⋮ Solving a school bus scheduling problem with integer programming
This page was built for publication: