scientific article; zbMATH DE number 3895002
From MaRDI portal
zbMath0562.00014MaRDI QIDQ5187226
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Conference proceedings and collections of articles (00Bxx)
Related Items
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Constructing competitive tours from local information, Topological design of a two-level network with ring-star configuration, Further results on the probabilistic traveling salesman problem, Matrix Relaxations in Combinatorial Optimization, Average optimal cost for the Euclidean TSP in one dimension, Global strategies for augmenting the efficiency of TSP heuristics, Special cases of travelling salesman problems and heuristics, Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems, Approximation Algorithms for Not Necessarily Disjoint Clustered TSP, Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Unnamed Item, A PARALLEL BEST-FIRST B&B ALGORITHM AND ITS AXIOMATIZATION, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, An exact algorithm with linear complexity for a problem of visiting megalopolises, Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck, Block-Wise Variable Selection for Clustering Via Latent States of Mixture Models, A sub-modular receding horizon solution for mobile multi-agent persistent monitoring, Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions, Compact formulations for multi-depot routing problems: theoretical and computational comparisons, The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem, A tutorial on the balanced minimum evolution problem, New TSP construction heuristics and their relationships to the 2-opt, A partitioning column approach for solving LED sorter manipulator path planning problems, Polyhedral Combinatorics in Combinatorial Optimization, Accelerating a continuous-time analog SAT solver using GPUs, Truly tight bounds for TSP heuristics, Learn global and optimize local: a data-driven methodology for last-mile routing, Hölder curves and parameterizations in the Analyst's traveling salesman theorem, A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location, The family traveling salesman problem with incompatibility constraints, Heuristic approaches for the family traveling salesman problem, The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods, Probabilistic analysis of optimization problems on sparse random shortest path metrics, Sometimes travelling is easy: The master tour problem, A 3/4 differential approximation algorithm for traveling salesman problem, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, Online TSP with known locations, Achieving feasibility for clustered traveling salesman problems using PQ‐trees, Replenishment routing problems between a single supplier and multiple retailers with direct delivery, Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows, Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, Optimal transport methods for combinatorial optimization over two random point sets, Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem, Time complexity of the analyst's traveling salesman algorithm, The symmetric quadratic traveling salesman problem, A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem, The traveling salesman problem on cubic and subcubic graphs, Recent progress of local search in handling the time window constraints of the vehicle routing problem, The symmetric generalized traveling salesman polytope, Discrete optimization by optimal control methods. II: The static traveling salesman problem, Data Structures and their Planar Graph Layouts, On polyhedra induced by point sets in space, A general system for heuristic minimization of convex functions over non-convex sets, Single vehicle routing with a predefined customer sequence and multiple depot returns, TSP on Cubic and Subcubic Graphs, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, Formulations and exact algorithms for the vehicle routing problem with time windows, Separating maximally violated comb inequalities in planar graphs, Online Vehicle Routing Problems: A Survey, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Vehicle Routing Problems and Container Terminal Operations – An Update of Research, Traveling salesman path problems, The prize collecting traveling salesman problem, Recent progress of local search in handling the time window constraints of the vehicle routing problem, The linear ordering problem with cumulative costs, Determination of the candidate arc set for the asymmetric traveling salesman problem, Expanding neighborhood GRASP for the traveling salesman problem, Planning as heuristic search, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Toughness in graphs -- a survey, Planning and control in artificial intelligence: A unifying perspective, Locating a cycle in a transportation or a telecommunications network, The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints, On pedigree polytopes and Hamiltonian cycles, A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem, Rotation cycle schedulings for multi-item production systems., Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem, Performance of linear-space search algorithms, Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem, Development and implementation of algorithms for vehicle routing during a no-notice evacuation, Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration, Unnamed Item, Last-Mile Shared Delivery: A Discrete Sequential Packing Approach, Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, A note on single alternating cycle neighborhoods for the TSP, Fast local search algorithms for the handicapped persons transportation problem, Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices, SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS, Automatic production planning of press brakes for sheet metal bending, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, The traveling salesman problem with few inner points, On finding a cyclic tour and a vehicle loading plan yielding maximum profit, An introduction to parallelism in combinatorial optimization, Linearizable special cases of the QAP, A parallel tabu search algorithm for large traveling salesman problems, Nearest-neighbour heuristics in accelerated algorithms of optimisation problems, The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem, MP or not MP: that is the question, The multiple traveling salesman problem on spiders, Robust optimization for routing problems on trees, Online \(k\)-server routing problems, Network design with edge-connectivity and degree constraints, Solving the traveling repairman problem on a line with general processing times and deadlines, On the recoverable robust traveling salesman problem, Computing the maximum violation of a Bell inequality is an NP-problem, Ordered spatial sampling by means of the traveling salesman problem, On common edges in optimal solutions to traveling salesman and other optimization problems, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices, A (0-1) goal programming model for scheduling the tour of a marketing executive, Load-dependent and precedence-based models for pickup and delivery problems, Continuous reductions among combinatorial optimization problems, A new asymmetric pyramidally solvable class of the traveling salesman problem, Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation, Bound sets for biobjective combinatorial optimization problems, The dragon war, Controlled mobility in stochastic and dynamic wireless networks, A stochastic and dynamic model for the single-vehicle pick-up and delivery problem, Submodularity and the traveling salesman problem, A simple LP relaxation for the asymmetric traveling salesman problem, The parameterized complexity of local search for TSP, more refined, Sequencing and scheduling in robotic cells: recent developments, An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem, Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem, Traveling salesman problem with clustering, Maximum travelling salesman problem. I, Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs, The multiple traveling salesmen problem with moving targets, Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, Analyzing the Held-Karp TSP bound: A monotonicity property with application, On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space, The \((n^ 2-1)\)-puzzle and related relocation problems, An efficient implementation of local search algorithms for constrained routing problems, Synchronized routing of seasonal products through a production/distribution network, A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem, A note on the traveling salesman reoptimization problem under vertex insertion, The on-line asymmetric traveling salesman problem, Sequencing situations with just-in-time arrival, and related games, The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, An additive bounding procedure for the asymmetric travelling salesman problem, Traveling salesman games, Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above, A note on the effect of neighborhood structure in simulated annealing, The travelling salesman problem and adiabatic quantum computation: an algorithm, How to find Steiner minimal trees in Euclidean \(d\)-space, Natural and extended formulations for the time-dependent traveling salesman problem, Approximate algorithms for the traveling salesman problem. II, A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs, Golden ratio versus pi as random sequence sources for Monte Carlo integration, Using immune-based genetic algorithms for single trader's periodic marketing problem, Combined route capacity and route length models for unit demand vehicle routing problems, The traveling salesman problem: An overview of exact and approximate algorithms, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems, Exact methods for solving the elementary shortest and longest path problems, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, The stochastic vehicle routing problem revisited, Experimental analysis of heuristics for the bottleneck traveling salesman problem, Quick updates for \(p\)-opt TSP heuristics, Traveling salesman problem under categorization, On the solving strategy in composite heuristics, Polyhedral study of the capacitated vehicle routing problem, Survivable networks, linear programming relaxations and the parsimonious property, On the complexity of generating synchronizable test sequences, Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Consecutive block minimization is 1.5-approximable, Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s), Optimal search path for service in the presence of disruptions, An efficient procedure for the N-city traveling salesman problem, Randomized gravitational emulation search algorithm for symmetric traveling salesman problem, The indefinite period traveling salesman problem, Global versus local search: the impact of population sizes on evolutionary algorithm performance, Model-based view planning, Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem, Algebraic languages for mathematical programming, Approximation algorithms for multi-criteria traveling salesman problems, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, An improved annealing scheme for the QAP, A genetic algorithm for service level based vehicle scheduling, Vehicle routing problem with trailers, The use of dynamic programming in genetic algorithms for permutation problems, Stability aspects of the traveling salesman problem based on \(k\)-best solutions, A stochastic and dynamic routing policy using branching processes with state dependent immigration, Minimum directed 1-subtree relaxation for score orienteering problem, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, Reoptimization of minimum and maximum traveling salesman's tours, A class of exponential neighbourhoods for the quadratic travelling salesman problem, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, A cutting-plane approach to the edge-weighted maximal clique problem, A novel machine grouping and knowledge-based approach for cellular manufacturing, Best-so-far vs. where-you-are: Implications for optimal finite-time annealing, Generating subtour elimination constraints for the TSP from pure integer solutions, Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion, The searching over separators strategy to solve some NP-hard problems in subexponential time, An improved heuristic for the period traveling salesman problem, New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints, Embedded local search approaches for routing optimization, Genetically improved presequences for Euclidean traveling salesman problems, Complexity of flow shop scheduling problems with transportation constraints, A new adaptive multi-start technique for combinatorial global optimizations, A new exact algorithm for the solution of quadratic assignment problems, Monge matrices make maximization manageable, A new heuristic for the period traveling salesman problem, The order of points on the second convex hull of a simple polygon, Evaluating the quality of online optimization algorithms by discrete event simulation, Path covering problems and testing of printed circuits, Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison, On the recognition of permuted bottleneck Monge matrices, Dealing with time in the multiple traveling salespersons problem with moving targets, The Steiner traveling salesman problem with online advanced edge blockages, The flexible periodic vehicle routing problem, Approximation of the Shapley value for the Euclidean travelling salesman game, Technical note: the expected length of an orderly path, On properties of geometric random problems in the plane, The two-stripe symmetric circulant TSP is in P, Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope, Expected part delays as a secondary layout criterion in automated manufacturing systems, Solving large-scale TSP using a fast wedging insertion partitioning approach, Genetic algorithms for the traveling salesman problem, Designing and reporting on computational experiments with heuristic methods, Hamiltonian numbers in oriented graphs, On global integer extrema of real-valued box-constrained multivariate quadratic functions, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, A bound for the symmetric travelling salesman problem through matroid formulation, Online graph exploration: New results on old and new algorithms, Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem, An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles, The Euclidean traveling salesman problem and a space-filling curve, Transformations of generalized ATSP into ATSP., 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times., The multi-stripe travelling salesman problem, Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme, Genetic local search with distance preserving recombination operator for a vehicle routing problem., Polyhedron of triangle-free simple 2-matchings in subcubic graphs, On Gilmore-Gomory's open question for the bottleneck TSP., Modelling and solving central cycle problems with integer programming., Solving the traveling salesman problem with interdiction and fortification, On the nearest neighbor rule for the traveling salesman problem, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, The salesman's improved tours for fundamental classes, Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges, A customized genetic algorithm for bi-objective routing in a dynamic network, Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal, A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions, Polynomially solvable cases of the bipartite traveling salesman problem, Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles, Gossip algorithms for heterogeneous multi-vehicle routing problems, Geometric and LP-based heuristics for angular travelling salesman problems in the plane, DNA origami and the complexity of Eulerian circuits with turning costs, An exact method for scheduling a yard crane, The effect of the asymmetry of road transportation networks on the traveling salesman problem, A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery, Complexity of the directed spanning cactus problem, Can the agent with limited information solve travelling salesman problem?, Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints, On the core of traveling salesman games, High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system, Shortest Dubins paths through three points, Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs, Exact and heuristic algorithms for routing AGV on path with precedence constraints, Sequential and parallel local search for the time-constrained traveling salesman problem, The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints, Routing heuristics for automated pick and place machines, Guided local search and its application to the traveling salesman problem, Generalized network design problems., Path planning for unmanned vehicles with localization constraints, TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer, Constrained spanning trees and the traveling salesman problem, New lower bounds for the symmetric travelling salesman problem, Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure, The asymmetric traveling salesman problem with replenishment arcs, On the linear ordering problem and the rankability of data, Computing in combinatorial optimization, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Approximation algorithms for lawn mowing and milling, Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection, A hitchhiker's guide to the techniques of adaptive nonlinear models, An effective implementation of the Lin-Kernighan traveling salesman heuristic, Determination of optimal path under approach and exit constraints, Evolving test instances of the Hamiltonian completion problem, An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices, New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization, The period traveling salesman problem: A new heuristic algorithm, Arranging program statements for locality on the basis of neighbourhood preferences, A combinatorial study of partial order polytopes, A complexity and approximation framework for the maximization scaffolding problem, Relaxed tours and path ejections for the traveling salesman problem, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
