Pages that link to "Item:Q653316"

The following pages link to Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316):

Displayed 7 items.

• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) ‎ (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) ‎ (← links)
• The bounded beam search algorithm for the block relocation problem (Q1634080) ‎ (← links)
• What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) ‎ (← links)
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) ‎ (← links)
• On the thinness and proper thinness of a graph (Q2414456) ‎ (← links)
• Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) ‎ (← links)