The following pages link to (Q4875843):
Displaying 43 items.
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Paint batching problem on \(M\)-to-1 conveyor systems (Q342469) (← links)
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks (Q342731) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Fault-tolerant Hamiltonian laceability of balanced hypercubes (Q528717) (← links)
- A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults (Q733731) (← links)
- Longest fault-free paths in hypercubes with vertex faults (Q819312) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A heuristic manipulation technique for the sequential ordering problem (Q925838) (← links)
- Solving the Hamiltonian path problem with a light-based computer (Q926517) (← links)
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults (Q955008) (← links)
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes (Q967363) (← links)
- Fault-free longest paths in star networks with conditional link faults (Q1006049) (← links)
- Hamiltonian connectivity of the WK-recursive network with faulty nodes (Q1031676) (← links)
- Order picking in an automatic warehouse: Solving online asymmetric TSPs (Q1304425) (← links)
- A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
- An improved ant colony system for the sequential ordering problem (Q1652370) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches (Q1974282) (← links)
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- Improving the filtering of branch-and-bound MDD solver (Q2117223) (← links)
- \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) (Q2144839) (← links)
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults (Q2268760) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant (Q2346376) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges (Q2385484) (← links)
- Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes (Q2458708) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models (Q2500540) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults (Q2798312) (← links)
- A time bucket formulation for the traveling salesman problem with time windows (Q2815434) (← links)
- Vertex-pancyclicity of twisted cubes with maximal faulty edges (Q4903570) (← links)
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams (Q6426110) (← links)
