Pages that link to "Item:Q3292045"
From MaRDI portal
The following pages link to A Dynamic Programming Approach to Sequencing Problems (Q3292045):
Displaying 35 items.
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
- Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)
- Sequencing jobs on a single machine: A neural network approach (Q5928440) (← links)
- Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations. (Q5936764) (← links)
- A general framework for enumerating equivalence classes of solutions (Q6046942) (← links)
- Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers (Q6048724) (← links)
- In-line kitting for part feeding of assembly lines: workload balancing and storage assignment to reduce the workers' walking effort (Q6049391) (← links)
- Two-stage dynamic programming in the routing problem with decomposition (Q6078066) (← links)
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
- Energy minimizing order picker forklift routing problem (Q6109806) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals (Q6138827) (← links)
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics (Q6153045) (← links)
- A bi-criteria moving-target travelling salesman problem under uncertainty (Q6167752) (← links)
- A bottleneck routing problem with a system of priority tasks (Q6169144) (← links)
- A note on a single-shift days-off scheduling problem with sequence-dependent labor costs (Q6173709) (← links)
- The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)
- Time complexity of the analyst's traveling salesman algorithm (Q6200929) (← links)
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem (Q6488350) (← links)
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals (Q6535280) (← links)
- Long directed detours: reduction to 2-disjoint paths (Q6551717) (← links)
- Winning the race to customers with micro-fulfillment centers: an approach for network planning in quick commerce (Q6558650) (← links)
- A unified pre-training and adaptation framework for combinatorial optimization on graphs (Q6564775) (← links)
- The routing bottlenecks problem (optimization within zones) (Q6571121) (← links)
- Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs (Q6585253) (← links)
- The simultaneous semi-random model for TSP (Q6589752) (← links)
- Few Hamiltonian cycles in graphs with one or two vertex degrees (Q6590640) (← links)
- A tabu search approach for the weighted tardiness with sequence-dependent setups in one-machine problem (Q6597111) (← links)
- Approximate and randomized algorithms for computing a second Hamiltonian cycle (Q6614106) (← links)
