Concorde
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- scientific article; zbMATH DE number 5876035 (Why is no real title available?)
- The symmetric quadratic traveling salesman problem
- Minimization and maximization versions of the quadratic travelling salesman problem
- Compact formulations of the Steiner traveling salesman problem and related problems
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics
- scientific article; zbMATH DE number 2084783 (Why is no real title available?)
- Solution of real-world postman problems
- Mobile sensor networks: system hardware and dispatch software
- Bilevel programming and the separation problem
- Lifting and separation procedures for the cut polytope
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Heuristics for vehicle routing problems: sequence or set optimization?
- Solving the traveling salesman problem with interdiction and fortification
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
- The power of recourse for online MST and TSP
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- Mileage bands in freight transportation
- POPMUSIC for the travelling salesman problem
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
- Computational experience with a software framework for parallel integer programming
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
- Integer linear programming models for topology optimization in sheet metal design
- Event-driven optimal control for a robotic exploration, pick-up and delivery problem
- Physical portrayal of computational complexity
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
- A new separation algorithm for the Boolean quadric and cut polytopes
- Evolving test instances of the Hamiltonian completion problem
- The salesman and the tree: the importance of search in CP
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- On learning and branching: a survey
- Genetic algorithm for combinatorial path planning: the subtour problem
- Computing compatible tours for the symmetric traveling salesman problem
- A note on the extension complexity of the knapsack polytope
- What you should know about the vehicle routing problem
- Hölder curves and parameterizations in the Analyst's traveling salesman theorem
- Change ringing and Hamiltonian cycles: the search for Erin and Stedman triples
- Periodic sequences of arbitrage: a tale of four currencies
- An experimental comparison of seriation methods for one-mode two-way data
- A general system for heuristic minimization of convex functions over non-convex sets
- New Bounds for the Traveling Salesman Constant
- Generalized traveling salesman problem reduction algorithms
- Application of imperialist competitive algorithm on solving the traveling salesman problem
- A polyhedral study of the quadratic traveling salesman problem
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Solving travelling salesman problem using ant systems: a programmer's approach
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane
- The 2-edge-connected subgraph polyhedron
- Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding
- Local cuts revisited
- Improved filtering for weighted circuit constraints
- Algorithm runtime prediction: methods \& evaluation
- A new approach to solve the classical symmetric traveling salesman problem by zero suffix method
- A scheduling problem in the baking industry
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- A network flow model for biclustering via optimal re-ordering of data matrices
- A new approach for vehicle routing with stochastic demand: combining route assignment with process flexibility
- George Dantzig's contributions to integer programming
- Heuristics for the traveling repairman problem with profits
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Information-theoretic approaches to branching in search
- Using River Formation Dynamics to Design Heuristic Algorithms
- Method of scaling in approximate solution of the traveling salesman problem
- Binary Steiner trees: structural results and an exact solution approach
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Improved exact method for the double TSP with multiple stacks
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Continuous approximation models in freight distribution management
- Finding good tours for huge Euclidean TSP instances by iterative backbone contraction
- Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications
- On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- A location-routing problem in glass recycling
- Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms
- Selfish transportation games
- A minimum spanning tree based heuristic for the travelling salesman tour
- The dynamic dispatch waves problem for same-day delivery
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- Local cuts for mixed-integer programming
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
- The clustered orienteering problem
- On generalizations of the Petersen graph and the Coxeter graph
- Could we use a million cores to solve an integer program?
- Heuristic methods to consecutive block minimization
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Iterated local search for consecutive block minimization
- Single liner shipping service design
- A branch-and-bound algorithm for the close-enough traveling salesman problem
- Pattern discrete and mixed hit-and-run for global optimization
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
This page was built for software: Concorde
