scientific article
From MaRDI portal
Publication:3720323
zbMath0591.90090MaRDI QIDQ3720323
Bruce L. Golden, William R. jun. Stewart
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items (35)
Experimentation in optimization ⋮ Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem ⋮ A planning and scheduling model for onsertion in printed circuit board assembly ⋮ Scheduling in a sequence dependent setup environment with genetic search ⋮ DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits ⋮ Best practices for comparing optimization algorithms ⋮ Reverse logistics: simultaneous design of delivery routes and returns strategies ⋮ Solving a generalized traveling salesperson problem with stochastic customers ⋮ Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation ⋮ The traveling salesman problem with backhauls ⋮ Designing delivery districts for the vehicle routing problem with stochastic demands ⋮ Ejection chains, reference structures and alternating path methods for traveling salesman problems ⋮ Divide and conquer strategies for parallel TSP heuristics ⋮ Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows ⋮ The complexity of searching implicit graphs ⋮ Truly tight bounds for TSP heuristics ⋮ \(k\)-interchange heuristic as an optimization procedure for material handling applications ⋮ Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem ⋮ The complexity of searching succinctly represented graphs ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ On the solving strategy in composite heuristics ⋮ Match twice and stitch: a new TSP tour construction heuristic. ⋮ A computational study of parametric tabu search for 0-1 mixed integer programs ⋮ Unnamed Item ⋮ A distributed genetic algorithm for deterministic and stochastic labor scheduling problems ⋮ Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation ⋮ Mechanisms for local search ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure ⋮ New edges not used in shortest tours of TSP ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ Heuristics for the flow line problem with setup costs ⋮ An improved assignment lower bound for the Euclidean traveling salesman problem ⋮ A decision-theoretic framework for comparing heuristics ⋮ A location-or-routing problem with partial and decaying coverage
This page was built for publication:
