Hochbaum Dorit S.

Dorit S. Hochbaum

Information about the author Dorit S. Hochbaum will soon be added to the site.
Found 39 papers in total
The inequality-satisfiability problem
The inequality-satisfiability problem
2008
We define a generalization of the satisfiability problem (SAT) where each...
Complexity and algorithms for nonlinear optimization problems
Complexity and algorithms for nonlinear optimization problems
2007
Nonlinear optimization algorithms are rarely discussed from a complexity point of...
Methodologies and algorithms for group-rankings decision
Methodologies and algorithms for group-rankings decision
2006
The problem of group ranking, also known as rank aggregation, has been studied in...
50th anniversary article: selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today
50th anniversary article: selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today
2004
Motivated by applications in freight handling and open-pit mining, Rhys, Balinski, and...
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such...
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
2004
We consider a convex, or nonlinear, separable minimization problem with constraints...
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
1999
We present a new linear programming relaxation for the problem of minimizing the sum...
Monotonizing linear programs with up to two nonzeroes per column
Monotonizing linear programs with up to two nonzeroes per column
2004
Linear programming problems with up to two nonzeroes per column in the constraint...
Efficient algorithms for the inverse spanning-tree problem
Efficient algorithms for the inverse spanning-tree problem
2003
The inverse spanning-tree problem is to modify edge weights in a graph so that a given...
The bounded cycle-cover problem
The bounded cycle-cover problem
2001
We consider the bounded cycle-cover problem, which is to find a minimum cost cycle...
Capacity acquisition, subcontracting, and lot sizing
Capacity acquisition, subcontracting, and lot sizing
2001
The fundamental question encountered in acquiring capacity to meet nonstationary...
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
2002
We define a class of monotone integer programs with constraints that involve up to...
Baseball, optimization, and the World Wide Web
Baseball, optimization, and the World Wide Web
2002
The competition for baseball play-off spots – the fabled pennant race – is...
A new–old algorithm for minimum-cut and maximum-flow in closure graphs
A new–old algorithm for minimum-cut and maximum-flow in closure graphs
2001
We present an algorithm for solving the minimum-cut problem on closure graphs without...
The bounded cycle-cover problem
The bounded cycle-cover problem
2001
We consider the bounded cycle-cover problem, which is to find a minimum cost cycle...
Performance analysis and best implementations of old and new algorithms for the open-pit mining problem
Performance analysis and best implementations of old and new algorithms for the open-pit mining problem
2000
The open-pit mining problem is to determine the contours of a mine, based on economic...
The bottleneck graph partition problem
The bottleneck graph partition problem
1996
The bottleneck graph partition problem is to partition the nodes of a graph into two...
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
1999
We investigate a special case of the bottleneck transportation problem where the...
A new and fast approach to very large scale integrated sequential circuit test generation
A new and fast approach to very large scale integrated sequential circuit test generation
1997
We present a new approach to automatic test pattern generation for very large scale...
Scheduling semiconductor burn-in operations to minimize total flowtime
Scheduling semiconductor burn-in operations to minimize total flowtime
1997
This paper addresses a problem of batch scheduling which arises in the burn-in stage...
Locating centers in a dynamically changing network, and related problems
Locating centers in a dynamically changing network, and related problems
1998
In a dynamically changing network, the costs or distances between locations are...
Analysis of the greedy approach in problems of maximum k-coverage
Analysis of the greedy approach in problems of maximum k-coverage
1998
In this paper, we consider a general covering problem in which k subsets are to be...
Generalized p-Center problems: Complexity results and approximation algorithms
Generalized p-Center problems: Complexity results and approximation algorithms
1997
In an earlier paper, two alternative p -Center problems, where the centers serving...
A nonlinear Knapsack problem
A nonlinear Knapsack problem
1995
The nonlinear Knapsack problem is to maximize a separable concave objective function,...
Papers per page: