Heuristics and lower bounds for the bin packing problem with conflicts
Computers and Operations Research
Determining a Minimum Spanning Tree with Disjunctive Constraints
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
Computers and Operations Research
Scheduling of a smart antenna: capacitated coloring of unit circular-arc graphs
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
The min-conflict packing problem
Computers and Operations Research
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Online variable-sized bin packing with conflicts
Discrete Optimization
Non-overlapping clone pooling for high-throughput sequencing
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Multi-dimensional packing with conflicts
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm
INFORMS Journal on Computing
The maximum flow problem with disjunctive constraints
Journal of Combinatorial Optimization
Nonoverlapping Clone Pooling for High-Throughput Sequencing
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations
Journal of Combinatorial Optimization
| Hi-index | 0.00 |