scientific article
From MaRDI portal
Publication:3475129
zbMath0697.90056MaRDI QIDQ3475129
Gerd Finke, Armin Claus, Eldon A. Gunn
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-boundlower boundtravelling salesmanlinear programming relaxationtwo-commodity network flow
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items (16)
An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size ⋮ Solving the multi-vehicle multi-covering tour problem ⋮ Solution algorithms for synchronous flow shop problems with two dominating machines ⋮ Paint batching problem on \(M\)-to-1 conveyor systems ⋮ Routing problems: A bibliography ⋮ A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem ⋮ Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses ⋮ Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints ⋮ Classification of travelling salesman problem formulations ⋮ Recent advances in vehicle routing exact algorithms ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ A comparative analysis of several asymmetric traveling salesman problem formulations ⋮ On symmetric subtour problems ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ Immunity-based evolutionary algorithm for optimal global container repositioning in liner shipping ⋮ An efficient genetic algorithm for the traveling salesman problem with precedence constraints
This page was built for publication:
