Pages that link to "Item:Q421551"

The following pages link to Dominance rules in combinatorial optimization problems (Q421551):

Displaying 9 items.

• Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
• An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
• A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
• Order acceptance and due-date quotation in low machine rates (Q1630128) (← links)
• Robust routing in deterministic delay-tolerant networks (Q1651586) (← links)
• Modeling elements and solving techniques for the data dissemination problem (Q1752253) (← links)
• Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
• An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
• Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)