scientific article
From MaRDI portal
Publication:3425132
zbMath1130.90036MaRDI QIDQ3425132
David L. Applegate, Vašek Chvátal, William Cook, Robert E. Bixby
Publication date: 5 March 2007
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) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
Reformulating the disjunctive cut generating linear program ⋮ On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem ⋮ On residual approximation in solution extension problems ⋮ Computing equilibria: a computational complexity perspective ⋮ Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization ⋮ Integer programming formulations for the elementary shortest path problem ⋮ The hybrid electric vehicle-traveling salesman problem ⋮ An optimal path planning problem for heterogeneous multi-vehicle systems ⋮ Heuristics for the traveling repairman problem with profits ⋮ Dynamic design of sales territories ⋮ An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem ⋮ Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm ⋮ Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope ⋮ A hybrid approach for biobjective optimization ⋮ Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics ⋮ Multi-depot multiple TSP: a polyhedral study and computational results ⋮ Strong lift-and-project cutting planes for the stable set problem ⋮ The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach ⋮ Routing problems with loading constraints ⋮ On global integer extrema of real-valued box-constrained multivariate quadratic functions ⋮ A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem ⋮ A note on the polytope of bipartite TSP ⋮ Traveling salesman problem with clustering ⋮ Complexity of graphs generated by wheel graph and their asymptotic limits ⋮ Lifting and separation procedures for the cut polytope ⋮ Bilevel programming and the separation problem ⋮ Computing the variance of tour costs over the solution space of the TSP in polynomial time ⋮ Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs ⋮ Physical portrayal of computational complexity ⋮ A semidefinite optimization approach to the target visitation problem ⋮ New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ⋮ The late acceptance hill-climbing heuristic ⋮ Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times ⋮ Efficient filtering for the resource-cost alldifferent constraint ⋮ Instance-specific multi-objective parameter tuning based on fuzzy logic ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts ⋮ A note on using the resistance-distance matrix to solve Hamiltonian cycle problem ⋮ A comparison of lower bounds for the symmetric circulant traveling salesman problem ⋮ Pattern discrete and mixed hit-and-run for global optimization ⋮ Data transfer planning with tree placement for collaborative environments ⋮ Number of spanning trees of different products of complete and complete bipartite graphs ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ Certifying algorithms ⋮ Event-driven optimal control for a robotic exploration, pick-up and delivery problem ⋮ Strong-branching inequalities for convex mixed integer nonlinear programs ⋮ Improved filtering for weighted circuit constraints ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ Application of imperialist competitive algorithm on solving the traveling salesman problem ⋮ The travelling salesman problem and adiabatic quantum computation: an algorithm ⋮ Efficiently embedding QUBO problems on adiabatic quantum computers ⋮ On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances ⋮ Travelling salesman problem in tissue P systems with costs ⋮ A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ George Dantzig's contributions to integer programming ⋮ Integer linear programming for the Bayesian network structure learning problem ⋮ Multiple depot ring star problem: a polyhedral study and an exact algorithm ⋮ Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications ⋮ Scaling laws for maximum coloring of random geometric graphs ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ The windy rural postman problem with a time-dependent zigzag option ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Three enhancements for optimization-based bound tightening ⋮ Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times ⋮ Geometric and LP-based heuristics for angular travelling salesman problems in the plane ⋮ The effect of the asymmetry of road transportation networks on the traveling salesman problem ⋮ Computing compatible tours for the symmetric traveling salesman problem ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming ⋮ Simpler analysis of LP extreme points for traveling salesman and survivable network design problems ⋮ Validating vehicle routing zone construction using Monte Carlo simulation ⋮ A library of local search heuristics for the vehicle routing problem ⋮ Complexity reduction preserving dynamical behavior of biochemical networks ⋮ A personalized walking bus service requiring optimized route decisions: a real case ⋮ The dynamic dispatch waves problem for same-day delivery ⋮ Cover-encodings of fitness landscapes ⋮ A minimum spanning tree based heuristic for the travelling salesman tour ⋮ Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem ⋮ Certification of an optimal TSP tour through 85,900 cities ⋮ SCIP: solving constraint integer programs ⋮ A credibilistic goal programming model for inventory routing problem with hazardous materials ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ Efficient formulations for the traveling car renter problem and its quota variant ⋮ A hybrid branch-and-bound approach for exact rational mixed-integer programming ⋮ Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem ⋮ Synchronized pickup and delivery problems with connecting FIFO stack ⋮ Concorde ⋮ Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem ⋮ Computing in combinatorial optimization ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform ⋮ Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem ⋮ Analyzing the performance of TSP solver methods ⋮ Unconstrained binary models of the travelling salesman problem variants for quantum optimization ⋮ Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation ⋮ Evolving test instances of the Hamiltonian completion problem ⋮ 2DPackLib: a two-dimensional cutting and packing library ⋮ Compact formulations of the Steiner traveling salesman problem and related problems ⋮ Flexible pair-copula estimation in D-vines using bivariate penalized splines
This page was built for publication:
