Pages that link to "Item:Q3292045"

The following pages link to A Dynamic Programming Approach to Sequencing Problems (Q3292045):

Displaying 16 items.

• Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← 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 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)