Pages that link to "Item:Q3292045"
From MaRDI portal
The following pages link to A Dynamic Programming Approach to Sequencing Problems (Q3292045):
Displaying 50 items.
- Sequencing of picking orders in mobile rack warehouses (Q1751810) (← links)
- Optimizing automated sorting in warehouses: the minimum order spread sequencing problem (Q1754761) (← links)
- Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← links)
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance (Q1762059) (← links)
- Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
- Constrained spanning trees and the traveling salesman problem (Q1823163) (← links)
- A simple linear expected time algorithm for finding a Hamilton path (Q1823260) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- Minimizing the sum of weighted completion times with unrestricted weights (Q1902889) (← links)
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights (Q1906942) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Truck scheduling in cross-docking terminals with fixed outbound departures (Q1944875) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- An extremal constrained routing problem with internal losses (Q1956632) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- An alternate formulation of the symmetric traveling salesman problem and its properties (Q1962065) (← links)
- Problem of optimal choice of a route under conditions of time discounting (Q1968514) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- DNA origami and the complexity of Eulerian circuits with turning costs (Q2003481) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem (Q2039712) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks (Q2061347) (← links)
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks (Q2071605) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- A fair-cost analysis of the random neighbor sampling method (Q2086576) (← links)
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem (Q2090221) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
- The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
- On the analysis of optimization problems in arc-dependent networks (Q2172089) (← links)
- Logistics planning of cash transfer to Syrian refugees in Turkey (Q2242358) (← links)
- On one approach to TSP structural stability (Q2248701) (← links)
- A new upper bound for the traveling salesman problem in cubic graphs (Q2250536) (← links)
- Scheduling just-in-time part supply for mixed-model assembly lines (Q2275595) (← links)
- Single machine scheduling with nonlinear cost functions (Q2277133) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
