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.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Cyclic inventory routing in a line-shaped network (Q322426) (← links)
- The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance (Q351554) (← links)
- Correlated topographic analysis: estimating an ordering of correlated components (Q374131) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Exact algorithms for inventory constrained scheduling on a single machine (Q398845) (← links)
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- An exact iterative search algorithm for constrained Markov decision processes (Q458792) (← links)
- Elements of dynamic programming in extremal routing problems (Q463354) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Routing under constraints: problem of visit to megalopolises (Q510285) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- Design tools for reporter strands and DNA origami scaffold strands (Q529038) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Constrained optimal routing (Q542269) (← links)
- A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
- Distance conserving reductions for nonoriented networks (Q594774) (← links)
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
- Finding and enumerating Hamilton cycles in 4-regular graphs (Q638522) (← links)
- Evolutionary algorithms and dynamic programming (Q652137) (← links)
- Single machine scheduling with flow time and earliness penalties (Q686991) (← links)
- Inclusion and exclusion algorithm for the Hamiltonian path problem (Q689624) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- Designing group behavior algorithms for autonomous underwater vehicles in the underwater local heterogeneities survey problem (Q747241) (← links)
- Sorting can exponentially speed up pure dynamic programming (Q783692) (← links)
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
- Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
- Single machine scheduling under market uncertainty (Q856210) (← links)
- Customer order scheduling on a single machine with family setup times: complexity and algorithms (Q870129) (← links)
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669) (← links)
