Pages that link to "Item:Q1970333"

The following pages link to An approximation scheme for bin packing with conflicts (Q1970333):

Displaying 35 items.

• The maximum flow problem with disjunctive constraints (Q358660) (← links)
• Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
• Online variable-sized bin packing with conflicts (Q429693) (← links)
• The table placement problem: a research challenge at the EWI 2007 (Q458951) (← links)
• Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
• An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
• Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
• Models and complexity of multibin packing problems (Q864931) (← links)
• Two-dimensional packing with conflicts (Q929297) (← links)
• VNS matheuristic for a bin packing problem with a color constraint (Q1687630) (← links)
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
• Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• The vehicle routing problem with heterogeneous locker boxes (Q2033310) (← links)
• Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
• Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
• On the minimum clique partitioning problem on weighted chordal graphs (Q2272395) (← links)
• Online results for black and white bin packing (Q2344213) (← links)
• Batched bin packing revisited (Q2398649) (← links)
• A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
• A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554) (← links)
• Algorithms for the two dimensional bin packing problem with partial conflicts (Q2893341) (← links)
• A survey on vertex coloring problems (Q3002686) (← links)
• Approximation of a batch consolidation problem (Q3113503) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• (Q3390778) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
• (Q5092396) (← links)
• Bin packing with directed stackability conflicts (Q5501519) (← links)
• Robustly assigning unstable items (Q5918516) (← links)
• Minimum cost flow problem with conflicts (Q6065835) (← links)
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)
• Security-aware database migration planning (Q6154181) (← links)
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)