Pages that link to "Item:Q1848594"

The following pages link to The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594):

Displaying 16 items.

• The Red-Blue transportation problem (Q296580) (← links)
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
• The transportation problem with conflicts (Q829180) (← links)
• Exact algorithms for procurement problems under a total quantity discount structure (Q859947) (← links)
• The transportation problem with exclusionary side constraints (Q1022437) (← links)
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
• A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints (Q1389247) (← links)
• Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
• Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
• A matheuristic for a customer assignment problem in direct marketing (Q2171614) (← links)
• Assignment problem with conflicts (Q2273673) (← links)
• Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
• Minimum cost noncrossing flow problem on layered networks (Q2414449) (← links)
• Solvability of transportation problems with exclusions (Q3033558) (← links)
• Minimum cost flow problem with conflicts (Q6065835) (← links)
• Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)