scientific article

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

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, A note on computational aspects of the Steiner traveling salesman problem, A matheuristic for the MinMax capacitated open vehicle routing problem, Optimisation via encodings: a renormalisation group perspective, Heuristic approaches for the family traveling salesman problem, The double traveling salesman problem with partial last‐in‐first‐out loading constraints, Exponential neighborhood search for consecutive block minimization, The two‐echelon routing problem with truck and drones, The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods, Results for the close-enough traveling salesman problem with a branch-and-bound algorithm, Polyhedral techniques in combinatorial optimization: matchings and tours, To improve the performance of genetic algorithms by using a novel selection operator, A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle, Simple powerful robust tests based on sign depth, A bi-criteria moving-target travelling salesman problem under uncertainty, Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks, Some contributions of Ailsa H. Land to the study of the traveling salesman problem, On the generation of metric TSP instances with a large integrality gap by branch-and-cut, New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule, Improving a constructive heuristic for the general routing problem, Time complexity of the analyst's traveling salesman algorithm, Generating subtour elimination constraints for the TSP from pure integer solutions, Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction, A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture, Optimal patchings for consecutive ones matrices, PERIODIC SEQUENCES OF ARBITRAGE: A TALE OF FOUR CURRENCIES, Multilevel asymptotic-preserving Monte Carlo for kinetic-diffusive particle simulations of the Boltzmann-BGK equation, Disjunctive Cuts for Nonconvex MINLP, Robotic data mules for collecting data over sparse sensor fields, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, A new class of hard problem instances for the 0-1 knapsack problem, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, Separation, dimension, and facet algorithms for node flow polyhedra, Complexity of linear relaxations in integer programming, Learning the travelling salesperson problem requires rethinking generalization, On the Skeleton of the Polytope of Pyramidal Tours, Local cuts for mixed-integer programming, Block coordinate descent for smooth nonconvex constrained minimization, Fast separation for the three-index assignment problem, Efficient optimization of the Held-Karp lower bound, A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem, Human solution strategies for the vehicle routing problem: experimental findings and a choice-based theory, Compact formulations for multi-depot routing problems: theoretical and computational comparisons, On learning and branching: a survey, Vehicle routing on road networks: how good is Euclidean approximation?, A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection, New variable-length data compression scheme for solution representation of meta-heuristics, Reinforcement learning for combinatorial optimization: a survey, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, Edge Elimination in TSP Instances, A transformation technique for the clustered generalized traveling salesman problem with applications to logistics, Reordering Strategy for Blocking Optimization in Sparse Linear Solvers, Hölder curves and parameterizations in the Analyst's traveling salesman theorem, Multiple $k$-opt evaluation multiple $k$-opt moves with GPU high performance local search to large-scale traveling salesman problems, The drone-assisted pickup and delivery problem: an adaptive large neighborhood search metaheuristic, The family traveling salesman problem with incompatibility constraints, SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition, Winding indexes of Max. and Min. Hamiltonians in N-Gons, Unnamed Item, Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes, Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem, Research on improved ant colony optimization for traveling salesman problem, Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs, Unnamed Item, Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity, The symmetric quadratic traveling salesman problem, A study on the effects of normalized TSP features for automated algorithm selection, The covering Canadian traveller problem, Unnamed Item, Priority functions for the approximation of the metric TSP, Data-driven polynomial chaos expansion for machine learning regression, A note on the extension complexity of the knapsack polytope, Constraint Integer Programming: A New Approach to Integrate CP and MIP, FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS, Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier, EVERY LONGEST HAMILTONIAN PATH IN EVEN n-GONS, On the Metric $s$--$t$ Path Traveling Salesman Problem, An Exact Rational Mixed-Integer Programming Solver, Generalization of machine learning for problem reduction: a case study on travelling salesman problems, Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems, A customized genetic algorithm for bi-objective routing in a dynamic network, Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand, Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions, Hard to solve instances of the Euclidean traveling salesman problem, A tutorial on branch and cut algorithms for the maximum stable set problem, The travelling salesman problem with neighbourhoods: MINLP solution, A Polyhedral Characterization of Border Bases, Lexicographically minimizing axial motions for the Euclidean TSP, Assignment problem with conflicts, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, Solving linear programs with complementarity constraints using branch-and-cut, The Power of Recourse for Online MST and TSP, Semidefinite relaxations for partitioning, assignment and ordering problems, The Seventh Answer Set Programming Competition: Design and Results, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation, Semidefinite relaxations for partitioning, assignment and ordering problems, A branch-and-cut algorithm for the target visitation problem, An approximation algorithm for vehicle routing with compatibility constraints, Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration, The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme, A construction for directed in-out subgraphs of optimal size, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks, Number of spanning trees in the sequence of some graphs, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, New Bounds for the Traveling Salesman Constant, Pickup and delivery problem with incompatibility constraints, Strong Formulations for 2-Node-Connected Steiner Network Problems, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order, A scheduling problem in the baking industry, The complexity of some classes of pyramid graphs created from a gear graph, On the facial structure of symmetric and graphical traveling salesman polyhedra, A combinatorial branch-and-bound algorithm for box search, A new separation algorithm for the Boolean quadric and cut polytopes, A fast metaheuristic for the travelling salesperson problem with hotel selection, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations, Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph