The following pages link to On Bin Packing with Conflicts (Q3395015):
Displayed 22 items.
- Online bin packing with advice (Q261387) (← links)
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- More on batched bin packing (Q1785762) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- On bin packing with clustering and bin packing with delays (Q2234744) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Batched bin packing revisited (Q2398649) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- New models of graph-bin packing (Q2629236) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- THE GRAPH-BIN PACKING PROBLEM (Q3224960) (← links)
- Online Bin Packing with Advice of Small Size (Q3449804) (← links)
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
- Lower bounds for several online variants of bin packing (Q5915655) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← 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)