Now showing items 1-10 of 51
Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms
(Georgia Institute of Technology, 2003-12-01)
The optimal linear arrangement problem : algorithms and approximation
(Georgia Institute of Technology, 1997-05)
Resource constrained shortest paths and extensions
(Georgia Institute of Technology, 2009-01-09)
In this thesis, we use integer programming techniques to solve the resource constrained shortest path problem (RCSPP) which seeks a minimum cost path between two nodes in a directed graph subject to a finite set of resource ...
Numerical optimization for mixed logit models and an application
(Georgia Institute of Technology, 2008-01-08)
In this thesis an algorithm (MLOPT) for mixed logit models is proposed. Mixed logit models are flexible discrete choice models, but their estimation with large datasets involves the solution of a nonlinear optimization ...
Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs.
(Georgia Institute of Technology, 2008-12-19)
The first part of this research program concerns the development of customized and easily implementable Probably Approximately Correct (PAC)-learning algorithms for episodic tasks over acyclic state spaces. The defining ...
Algorithms for inverting Hodgkin-Huxley type neuron models
(Georgia Institute of Technology, 2009-08-21)
The study of neurons is of fundamental importance in biology and medicine. Neurons are the most basic unit of information processing in the nervous system of humans and all other vertebrates and in complex invertebrates. ...
Fast approximation algorithms for the minimum spillage problem
(Georgia Institute of Technology, 1983-12)
An implicit enumeration algorithm for integer programming
(Georgia Institute of Technology, 1970-12)
On weighted paths for nonlinear semidefinite complementarity problems and newton methods for semidefinite programming
(Georgia Institute of Technology, 1998-12)
Crew scheduling, cutting stock, and column generation : Solving huge integer programs
(Georgia Institute of Technology, 1993-08)