Pages that link to "Item:Q922284"
From MaRDI portal
The following pages link to On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284):
Displaying 10 items.
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- Balancing \(U\)-lines in a multiple \(U\)-line facility (Q1296689) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Solving a Routing Problem with the Aid of an Independent Computations Scheme (Q4692135) (← links)
- On one routing problem modeling movement in radiation fields (Q4961696) (← links)
- Finding a Level Ideal of a Poset (Q5323080) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
