activity
20182021
most citedBalancing Fairness and Efficiency in an Optimization Model

2 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2019

Optimization Bounds from the Branching Dual

J. G. Benade, J. N. Hooker

We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer…

cs.DS2019

Improved Job sequencing Bounds from Decision Diagrams

J. N. Hooker

We introduce a general method for relaxing decision diagrams that allows one to bound job sequencing problems by solving a Lagrangian dual problem on a relaxed diagram. We also pro…