scientific article; zbMATH DE number 1749221
From MaRDI portal
zbMath1076.90554MaRDI QIDQ4532224
Publication date: 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
MIP reformulations of the probabilistic set covering problem, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, Routing and scheduling field service operation by P-graph, Deterministic optimizational problems of transportation logistics, A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case, Formulations and exact algorithms for the vehicle routing problem with time windows, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Sequential search and its application to vehicle-routing problems, The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem, Unnamed Item, Fast local search algorithms for the handicapped persons transportation problem
