#### Filter Results:

#### Publication Year

2006

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We develop first-order smoothing techniques for saddle-point problems that arise in finding a Nash equilibrium of sequential games. The crux of our work is a construction of suitable prox-functions for a certain class of polytopes that encode the sequential nature of the game. We also introduce heuristics that significantly speed up the algorithm, and… (More)

We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a first-order gradient method based on modern smoothing techniques for non-smooth convex optimization. The algorithm requires O(1//) iterations to compute an-equilibrium, and the work… (More)

Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systematic approach to MDD-based constraint programming. First, we introduce a generic scheme for constraint propagation in MDDs. We show that all previously known propagation algorithms for MDDs can… (More)

We propose a new gradient based scheme to approximate Nash equilibria of large sequential two-player, zero-sum games. The algorithm uses modern smoothing techniques for saddle-point problems tailored specifically for the polytopes used in the Nash equilibrium problem.

- Ionut. Aron, Latife Genç-Kaya, Iiro Harjunkoski, Samid Hoda, J. N. Hooker
- 2010

We describe a specialized dynamic programming algorithm for factory crane scheduling. An innovative data structure controls the memory requirements of the state space and enables solution of problems of realistic size. The algorithm finds optimal space-time trajectories for two factory cranes or hoists that move along a single overhead track. Each crane is… (More)

Liquefied Natural Gas (LNG) is steadily becoming a common mode for commercializing natural gas. In this paper, we develop methods for improving both lower and upper bounds for a previously stated form of an LNG inventory routing problem. A Dantzig-Wolfe-based decomposition approach is developed for LNG inventory routing problem (LNG-IRP) attempting to… (More)

- Samid Hoda, Javier Peña, Willem-Jan van Hoeve, François Margot, Samuel Burer
- 2010

This thesis addresses three topics: solving the Nash Equilibrium problem for two-player zero-sum games presented in extensive form, constraint programming using multivalued decision diagrams and scheduling cranes in a factory. In the first chapter, we develop a first-order method based on a smoothing technique of Nesterov that allows us to solve problems… (More)

We describe a heuristic algorithm for scheduling the movement of multiple factory cranes mounted on a common track. The cranes must complete a sequence of tasks at locations along the track without crossing paths, while adhering as closely as possible to a factory production schedule. The algorithm creates a decision tree of possible states of the crane… (More)

- Willem‐jan Van Hoeve, David Bergman, Andre Cire, Samid Hoda, John Hooker, Brian Kell +11 others
- 2015

What can MDDs do for combinatorial optimization? • Compact representation of all solutions to a problem • Limit on size gives approximation • Control strength of approximation by size limit MDDs for integer optimization • MDD relaxations provide upper bounds • MDD restrictions provide lower bounds • New branch‐and‐bound scheme MDDs for constraint‐based… (More)

- ‹
- 1
- ›