Concorde

swMATH4770MaRDI QIDQ16936FDOQ16936

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• Bilevel programming and the separation problem
• Lifting and separation procedures for the cut polytope
• A comparison of lower bounds for the symmetric circulant traveling salesman problem
• Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
• Physical portrayal of computational complexity
• A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
• A note on the extension complexity of the knapsack polytope
• Genetic algorithm for combinatorial path planning: the subtour problem
• Computing compatible tours for the symmetric traveling salesman problem
• The 2-edge-connected subgraph polyhedron
• Local cuts revisited
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
• Using River Formation Dynamics to Design Heuristic Algorithms
• Information-theoretic approaches to branching in search
• Strong Formulations for 2-Node-Connected Steiner Network Problems
• Improved exact method for the double TSP with multiple stacks
• On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain
• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• Pattern discrete and mixed hit-and-run for global optimization
• Instance-specific multi-objective parameter tuning based on fuzzy logic
• A Polyhedral Study of the Quadratic Traveling Salesman Problem
• Dubins traveling salesman problem with neighborhoods: a graph-based approach
• Title not available (Why is that?)
• Algorithms and Data Structures
• Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• A branch-and-cut algorithm for capacitated network design problems
• Transformations of generalized ATSP into ATSP.
• Randomized heuristics for the family traveling salesperson problem
• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
• Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem
• Strong lift-and-project cutting planes for the stable set problem
• A heuristic approach for the travelling purchaser problem
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• Strong-branching inequalities for convex mixed integer nonlinear programs
• Certifying algorithms
• Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
• Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
• Estimation-based metaheuristics for the probabilistic traveling salesman problem
• Integrating operations research in constraint programming
• Validating vehicle routing zone construction using Monte Carlo simulation
• A discrete gravitational search algorithm for solving combinatorial optimization problems
• Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
• Multi-depot multiple TSP: a polyhedral study and computational results
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• Constrained discriminant analysis via \(0/1\) mixed integer programming
• Scaling laws for maximum coloring of random geometric graphs
• Complexity reduction preserving dynamical behavior of biochemical networks
• Continuous line drawings via the traveling salesman problem
• Problems of discrete optimization: challenges and main approaches to solve them
• Three enhancements for optimization-based bound tightening
• Title not available (Why is that?)
• Solution of real-world postman problems
• The power of recourse for online MST and TSP
• Computational experience with a software framework for parallel integer programming
• Integer linear programming models for topology optimization in sheet metal design
• A new separation algorithm for the Boolean quadric and cut polytopes
• On learning and branching: a survey
• New Bounds for the Traveling Salesman Constant
• Hölder curves and parameterizations in the Analyst's traveling salesman theorem
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Semidefinite relaxations for partitioning, assignment and ordering problems
• An experimental comparison of seriation methods for one-mode two-way data
• A network flow model for biclustering via optimal re-ordering of data matrices
• Title not available (Why is that?)
• An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
• Binary Steiner trees: structural results and an exact solution approach
• A minimum spanning tree based heuristic for the travelling salesman tour
• The dynamic dispatch waves problem for same-day delivery
• Could we use a million cores to solve an integer program?
• On generalizations of the Petersen graph and the Coxeter graph
• A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
• Separation, dimension, and facet algorithms for node flow polyhedra
• 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
• A semidefinite optimization approach to the target visitation problem
• The balanced traveling salesman problem
• Traveling salesman problem with clustering
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
• Model Checking the Ant Colony Optimisation
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
• Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
• A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
• Collaborative delivery with energy-constrained mobile robots
• Title not available (Why is that?)
• Parallel branch, cut, and price for large-scale discrete optimization
• Data transfer planning with tree placement for collaborative environments
• Approximating the metric TSP in linear time
• Seeking global edges for traveling salesman problem in multi-start search
• Nonoblivious 2-opt heuristics for the traveling salesman problem
• A computational software system to design order picking warehouses
• Deep policy dynamic programming for vehicle routing problems

This page was built for software: Concorde