Pages that link to "Item:Q932220"

The following pages link to Solving the car sequencing problem via branch \& bound (Q932220):

Displaying 17 items.

• A decomposition approach for the car resequencing problem with selectivity banks (Q339550) (← links)
• On the complexity of the car sequencing problem. (Q703239) (← links)
• Algorithms for the car sequencing and the level scheduling problem (Q880539) (← links)
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem (Q932175) (← links)
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem (Q932211) (← links)
• Two local search approaches for solving real-life car sequencing problems (Q932212) (← links)
• Soft car sequencing with colors: lower bounds and optimality proofs (Q932214) (← links)
• A beam search approach for the optimization version of the car sequencing problem (Q940889) (← links)
• Analysis and design of sequencing rules for car sequencing (Q976493) (← links)
• Sequencing mixed-model assembly lines to minimize part inventory cost (Q991825) (← links)
• Sequencing mixed-model assembly lines: survey, classification and model critique (Q1011163) (← links)
• Advanced constraint propagation for the combined car sequencing and level scheduling problem (Q1782169) (← links)
• The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
• Iterative beam search for car sequencing (Q2341215) (← links)
• Car sequencing versus mixed-model sequencing: a computational study (Q2514809) (← links)
• (Q3381088) (← links)
• The maximum length car sequencing problem (Q6565412) (← links)