Related references
Note: Only part of the references are listed.The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach
Michel Gendreau et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
A Branch-and-Cut Algorithm for the Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints
Daniele Manerba et al.
NETWORKS (2015)
Optimal solutions for a dock assignment problem with trailer transportation
Lotte Berghman et al.
ANNALS OF OPERATIONS RESEARCH (2014)
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm
Ruslan Sadykov et al.
INFORMS JOURNAL ON COMPUTING (2013)
Maximum-weight stable sets and safe lower bounds for graph coloring
Stephan Held et al.
MATHEMATICAL PROGRAMMING COMPUTATION (2012)
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
Samir Elhedhli et al.
INFORMS JOURNAL ON COMPUTING (2011)
Algorithms for the Bin Packing Problem with Conflicts
Albert E. Fernandes-Muritiba et al.
INFORMS JOURNAL ON COMPUTING (2010)
Mutual exclusion scheduling with interval graphs or related classes, Part I
Frederic Gardi
DISCRETE APPLIED MATHEMATICS (2009)
Scheduling with conflicts: online and offline algorithms
Guy Even et al.
JOURNAL OF SCHEDULING (2009)
Conflict Resolution in the Scheduling of Television Commercials
Daya Ram Gaur et al.
OPERATIONS RESEARCH (2009)
Heuristic and exact algorithms for the identical parallel machine scheduling problem
Mauro Dell'Amico et al.
INFORMS JOURNAL ON COMPUTING (2008)
A metaheuristic approach for the vertex coloring problem
Enrico Malaguti et al.
INFORMS JOURNAL ON COMPUTING (2008)
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
A Frangioni et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2004)
Scheduling with conflicts on bipartite and interval graphs
S Irani et al.
JOURNAL OF SCHEDULING (2003)
Separation of duties for access control enforcement in workflow environments
RA Botha et al.
IBM SYSTEMS JOURNAL (2001)
On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
F Vanderbeck
OPERATIONS RESEARCH (2000)
Share Paper
