The following pages link to (Q3206647):
Displaying 26 items.
- Efficient generation of the ideals of a poset in Gray code order. II (Q391390) (← links)
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem (Q582208) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem (Q928082) (← links)
- Efficient generation of the ideals of a poset in Gray code order (Q989454) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- An algorithm to generate the ideals of a partial order (Q1086160) (← links)
- Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- Balancing \(U\)-lines in a multiple \(U\)-line facility (Q1296689) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks (Q2071605) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming (Q2418162) (← links)
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
- A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering (Q3416015) (← links)
- A Note on One-Machine Scheduling Problems with Imperfect Information (Q3416016) (← links)
- Solving a Routing Problem with the Aid of an Independent Computations Scheme (Q4692135) (← links)
- Оptimization of the Start Point in the Gtsp with the Precedence Conditions (Q4963242) (← links)
- ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION (Q4986290) (← links)
- Two-stage dynamic programming in the routing problem with decomposition (Q6078066) (← links)
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics (Q6153045) (← links)
