Pages that link to "Item:Q320623"

The following pages link to The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623):

Displaying 22 items.

• Solving the team orienteering problem with cutting planes (Q342446) (← links)
• The bi-objective traveling purchaser problem with deliveries (Q1622816) (← links)
• New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• The traveling purchaser problem and its variants (Q1751767) (← links)
• Branch-and-price approaches for the multiperiod technician routing and scheduling problem (Q1752769) (← links)
• The undirected capacitated general routing problem with profits (Q1752868) (← links)
• The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
• Mathematical models for a ship routing problem with a small number of ports on a route (Q2110089) (← links)
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
• Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
• Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
• The traveling purchaser problem with fast service option (Q2669765) (← links)
• Optimization of logistics services in hospitals (Q4608286) (← links)
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← links)
• Minimum cost flow problem with conflicts (Q6065835) (← links)
• The family traveling salesman problem with incompatibility constraints (Q6065853) (← links)
• Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)