Pages that link to "Item:Q5378639"
From MaRDI portal
The following pages link to Solution of a Large-Scale Traveling-Salesman Problem (Q5378639):
Displaying 50 items.
- A solution framework for linear PDE-constrained mixed-integer problems (Q2044978) (← links)
- Galois connections for phylogenetic networks and their polytopes (Q2045067) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- A branch-and-price algorithm for solving the single-hub feeder network design problem (Q2116907) (← links)
- Learning to sparsify travelling salesman problem instances (Q2117244) (← links)
- Collection of different types of milk with multi-tank tankers under uncertainty: a real case study (Q2121608) (← links)
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games (Q2123122) (← links)
- Modelling and solving the milk collection problem with realistic constraints (Q2147008) (← links)
- A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- A waste collection problem with service type option (Q2160512) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
- A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes (Q2178911) (← links)
- A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685) (← links)
- Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP (Q2183196) (← links)
- An efficient and general approach for the joint order batching and picker routing problem (Q2183853) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
- Graph coloring-based approach for railway station design analysis and capacity determination (Q2189952) (← links)
- Optimization of order-picking problems by intelligent optimization algorithm (Q2193380) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- Facets from gadgets (Q2220662) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
- Maintaining the regular ultra passum law in data envelopment analysis (Q2256350) (← links)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm (Q2283932) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
- A branch and bound algorithm for agile earth observation satellite scheduling (Q2314755) (← links)
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics (Q2327442) (← links)
- Exact approaches for the cutting path determination problem (Q2329729) (← links)
- Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
- The influence of problem specific neighborhood structures in metaheuristics performance (Q2337103) (← links)
- An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- Scheduling multi-colour print jobs with sequence-dependent setup times (Q2341398) (← links)
- Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results (Q2343997) (← links)
