Pages that link to "Item:Q2899132"

The following pages link to A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts (Q2899132):

Displaying 23 items.

• Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
• Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• On the benchmark instances for the bin packing problem with conflicts (Q2056901) (← links)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
• A matheuristic for a customer assignment problem in direct marketing (Q2171614) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• A Lagrangian decomposition approach for the pump scheduling problem in water networks (Q2629691) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
• Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows (Q5086013) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
• Minimum cost flow problem with conflicts (Q6065835) (← links)
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
• Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits (Q6659822) (← links)