2 citations · 4 across the 3 of their papers we have counts for
8 papers
Balancing Fairness and Efficiency in an Optimization Model
Violet Xinying Chen, J. N. Hooker
Optimization models generally aim for efficiency by maximizing total benefit or minimizing cost. Yet a trade-off between fairness and efficiency is an important element of many pra…
A Brief Tour of Logic and Optimization
John Hooker
This paper is an informal survey of some of the deep connections between logic and optimization. It covers George Boole's probability logic, decision diagrams, logic and cutting pl…
Logic-based Benders decomposition for large-scale optimization
J. N. Hooker
Logic-based Benders decomposition (LBBD) is a substantial generalization of classical Benders decomposition that, in principle, allows the subproblem to be any optimization problem…
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…
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…
The Hamiltonian Circuit Polytope
Latife Genc-Kaya, J. N. Hooker
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequ…