scientific article
From MaRDI portal
Publication:3677509
zbMath0563.90075MaRDI QIDQ3677509
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (only showing first 100 items - show all)
The median tour and maximal covering tour problems: Formulations and heuristics ⋮ Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem ⋮ Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems ⋮ Two-edge connected spanning subgraphs and polyhedra ⋮ A novel approach for part family formation for reconfiguration manufacturing system ⋮ On the traveling salesman problem with a relaxed Monge matrix ⋮ Approximation algorithms for the TSP with sharpened triangle inequality ⋮ On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem ⋮ Tabu search performance on the symmetric travelling salesman problem ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Neural methods for the traveling salesman problem: Insights from operations research ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ LP-based solution methods for the asymmetric TSP ⋮ On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight ⋮ The Convex-hull-and-k-line Travelling Salesman Problem ⋮ An integer programming approach for solving the \(p\)-dispersion problem ⋮ hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up ⋮ On perfectly two-edge connected graphs ⋮ TSP ejection chains ⋮ A polynomial-time solution to Papadimitriou and Steiglitz's ``traps ⋮ Measure concentration in optimization ⋮ Optimization of the movements of a component placement machine ⋮ The two-convex-polygons TSP: A solvable case ⋮ Greedy-type resistance of combinatorial problems ⋮ Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs ⋮ A note on the complexity of the asymmetric traveling salesman problem ⋮ Boltzmann machines for travelling salesman problems ⋮ On the existence of schedules that are near-optimal for both makespan and total weighted completion time ⋮ An approximation algorithm for the TSP ⋮ Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem ⋮ Complexity of searching an immobile hider in a graph ⋮ Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines ⋮ A probabilistic analysis of the switching algorithm for the Euclidean TSP ⋮ Landscapes and their correlation functions ⋮ Design and control of warehouse order picking: a literature review ⋮ A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem ⋮ Some thoughts on combinatorial optimisation ⋮ Probabilistic combinatorial optimization problems on graphs: A new domain in operational research ⋮ The TSP phase transition ⋮ The doubly graded matrix cone and Ferrers matrices ⋮ On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices ⋮ Using well-solvable quadratic assignment problems for VLSI interconnect applications ⋮ Quotient geometric crossovers and redundant encodings ⋮ Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing ⋮ Survivable network design with demand uncertainty ⋮ Variable neighborhood tabu search and its application to the median cycle problem. ⋮ A note on dual solutions of the assignment problem in connection with the traveling salesman problem ⋮ Analyzing the Held-Karp TSP bound: A monotonicity property with application ⋮ On the equivalence between some local and global Chinese postman and traveling salesman graphs ⋮ Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem ⋮ Facet identification for the symmetric traveling salesman polytope ⋮ The ``molecular traveling salesman ⋮ Cost allocation: The traveling salesman, bin packing, and the knapsack ⋮ A bilevel programming approach to the travelling salesman problem. ⋮ Certifying algorithms ⋮ A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ A survey on optimization metaheuristics ⋮ On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances ⋮ Local search, reducibility and approximability of NP-optimization problems ⋮ Local optimization of neuron arbors ⋮ A multiperiod traveling salesman problem: Heuristic algorithms ⋮ Local search inequalities ⋮ The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times ⋮ The multiple-robot assembly plan problem ⋮ Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs ⋮ On symmetric subtour problems ⋮ Operational estimators for the length of a traveling salesman tour ⋮ A survey of very large-scale neighborhood search techniques ⋮ Data-independent neighborhood functions and strict local optima ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ Minimum-weight two-connected spanning networks ⋮ A diagonal completion and 2-optimal procedure for the travelling salesman problem ⋮ Probabilistic graph-coloring in bipartite and split graphs ⋮ The graphical relaxation: A new framework for the symmetric traveling salesman polytope ⋮ Greedy randomized adaptive search procedures ⋮ Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood ⋮ Genetic algorithms and traveling salesman problems ⋮ Genetic algorithms for the two-stage bicriteria flowshop problem ⋮ An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs ⋮ The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases ⋮ New edges not used in shortest tours of TSP ⋮ A model for warehouse order picking ⋮ Ant colony method to control variance reduction techniques in the Monte Carlo simulation of clinical electron linear accelerators of use in cancer therapy ⋮ Application of the noising method to the travelling salesman problem ⋮ Survey of facial results for the traveling salesman polytope ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems ⋮ On the expected optimal value of random assignment problems: Experimental results and open questions ⋮ Domination analysis of some heuristics for the traveling salesman problem ⋮ Rectifiable sets and the traveling salesman problem ⋮ Genetic local search in combinatorial optimization ⋮ The traveling salesmanpProblem for lines in the plane ⋮ Not all insertion methods yield constant approximate tours in the Euclidean plane ⋮ Parallelization strategies for rollout algorithms ⋮ Performance analysis of cyclical simulated annealing algorithms ⋮ Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. ⋮ Average-case analysis of best-first search in two representative directed acyclic graphs ⋮ Looking ahead with the pilot method
This page was built for publication:
