The following pages link to (Q3425132):
Displaying 50 items.
- George Dantzig's contributions to integer programming (Q951090) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics (Q1666410) (← links)
- On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- A note on the polytope of bipartite TSP (Q1682883) (← links)
- Complexity of graphs generated by wheel graph and their asymptotic limits (Q1686390) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
- Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem (Q1708538) (← links)
- Number of spanning trees of different products of complete and complete bipartite graphs (Q1719484) (← links)
- Event-driven optimal control for a robotic exploration, pick-up and delivery problem (Q1730345) (← links)
- Application of imperialist competitive algorithm on solving the traveling salesman problem (Q1736616) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications (Q1750463) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
- The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
- Complexity reduction preserving dynamical behavior of biochemical networks (Q1784362) (← links)
- Cover-encodings of fitness landscapes (Q1786928) (← links)
- Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (Q1787317) (← links)
- A credibilistic goal programming model for inventory routing problem with hazardous materials (Q1800339) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- Travelling salesman problem in tissue P systems with costs (Q1983010) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming (Q2009701) (← links)
- A personalized walking bus service requiring optimized route decisions: a real case (Q2029258) (← links)
- Efficient formulations for the traveling car renter problem and its quota variant (Q2047185) (← links)
- Synchronized pickup and delivery problems with connecting FIFO stack (Q2056913) (← links)
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem (Q2070343) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
- Analyzing the performance of TSP solver methods (Q2093970) (← links)
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
- Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
