David R. Morrison

According to our database1, David R. Morrison authored at least 12 papers between 2012 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams.
INFORMS J. Comput., 2016

Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning.
Discret. Optim., 2016

2015
Assigning Panels to Meeting Rooms at the National Science Foundation.
Interfaces, 2015

Characteristics of optimal solutions to the sensor location problem.
Ann. Oper. Res., 2015

2014
Complexity results for the basic residency scheduling problem.
J. Sched., 2014

An algorithm to solve the proportional network flow problem.
Optim. Lett., 2014

Characteristics of the maximal independent set ZDD.
J. Comb. Optim., 2014

A Wide Branching Strategy for the Graph Coloring Problem.
INFORMS J. Comput., 2014

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset.
Eur. J. Oper. Res., 2014

Solving the Pricing Problem in a Generic Branch-and-Price Algorithm using Zero-Suppressed Binary Decision Diagrams.
CoRR, 2014

2013
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network.
INFORMS J. Comput., 2013

2012
A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times.
J. Glob. Optim., 2012


  Loading...