scientific article; zbMATH DE number 795217
From MaRDI portal
zbMath0832.90118MaRDI QIDQ4845366
Giovanni Rinaldi, Michael Jünger, Gerhard Reinelt
Publication date: 5 March 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem, On Cutwidth Parameterized by Vertex Cover, The biobjective travelling purchaser problem, Novel concave hull-based heuristic algorithm for TSP, Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, Solving the asymmetric traveling purchaser problem, On the graphical relaxation of the symmetric traveling salesman polytope, A cutoff time strategy based on the coupon collector's problem, Separating clique tree and bipartition inequalities in polynomial time, Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers, Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, Improving a constructive heuristic for the general routing problem, An alternate formulation of the symmetric traveling salesman problem and its properties, On cutwidth parameterized by vertex cover, The on-line asymmetric traveling salesman problem, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Golden ratio versus pi as random sequence sources for Monte Carlo integration, Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time, Exploiting planarity in separation routines for the symmetric traveling salesman problem, Local search inequalities, On the power of lookahead in on-line server routing problems, Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, The common face of some 0/1-polytopes with NP-complete nonadjacency relation, New facets of the STS polytope generated from known facets of the ATS polytope, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, On the domino-parity inequalities for the STSP, Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time, A new integer programming formulation of the graphical traveling salesman problem, Combinatorial optimization and small polytopes, The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches, Frequency assignment in mobile radio systems using branch-and-cut techniques, Stronger \(K\)-tree relaxations for the vehicle routing problem, Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem, A computational study of smoothing heuristics for the traveling salesman problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Application of the noising method to the travelling salesman problem, A polyhedral approach to sequence alignment problems, On the facial structure of symmetric and graphical traveling salesman polyhedra, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
