Country: United States

Found 17049 papers in total
Server assignment policies for maximizing the steady-state throughput of finite queueing systems
Server assignment policies for maximizing the steady-state throughput of finite queueing systems
2001,
For a system of finite queues, we study how servers should be assigned dynamically to...
On a quadratic optimization problem with equality constraints
On a quadratic optimization problem with equality constraints
1998,
The constrained optimization problem with a quadratic cost functional and two...
On the quasiconcave bilevel programming problem
On the quasiconcave bilevel programming problem
1998,
Bilevel programming involves two optimization problems where the constraint region of...
Generalized column generation for linear programming
Generalized column generation for linear programming
2002,
Column generation is a well-known and widely practised technique for solving linear...
On the minimum norm solution of linear programs
On the minimum norm solution of linear programs
2003,
This paper describes a new technique to find the minimum norm solution of a linear...
A branch-and-price algorithm for switch-box routing
A branch-and-price algorithm for switch-box routing
2002,
Routing in VLSI design concerns the wiring of a chip after the logical modules have...
Approximating multiobjective knapsack problems
Approximating multiobjective knapsack problems
2002,
For multiobjective optimization problems, it is meaningful to compute a set of...
Improving discrete model representations via symmetry considerations
Improving discrete model representations via symmetry considerations
2001,
In this paper, we focus on a useful modeling concept that is frequently ignored while...
A note on the traveling repairman problem
A note on the traveling repairman problem
2002,
Given a finite set of N nodes and the time required for traveling among nodes, in the...
An approximate dynamic programming approach to multidimensional knapsack problems
An approximate dynamic programming approach to multidimensional knapsack problems
2002,
We present an Approximate Dynamic Programming (ADP) approach for the multidimensional...
Invex functions and generalized convexity in multiobjective programming
Invex functions and generalized convexity in multiobjective programming
1998,
Martin studied the optimality conditions of invex functions for scalar programming...
A polynomial-time algorithm to find shortest paths with recourse
A polynomial-time algorithm to find shortest paths with recourse
2003,
The Shortest Path with Recourse Problem involves finding the shortest expected-length...
Shortest-path network interdiction
Shortest-path network interdiction
2002,
We study the problem of interdicting the arcs in a network in order to maximize the...
Degree- and time-constrained broadcast networks
Degree- and time-constrained broadcast networks
2002,
We consider the problem of constructing networks with as many nodes as possible,...
Reserving resilient capacity for a single commodity with upper-bound constraints
Reserving resilient capacity for a single commodity with upper-bound constraints
2003,
Continuing research begun in a previous study, we investigate problems of reserving...
Approximation algorithms for constructing wavelength routing networks
Approximation algorithms for constructing wavelength routing networks
2002,
Consider a requirement graph whose vertices represent customers and an edge represents...
An improved algorithm for the minmax regret median problem on a tree
An improved algorithm for the minmax regret median problem on a tree
2003,
We consider the 1-median problem with uncertain weights for nodes. Specifically, for...
Dimensioning multicast-enabled communications networks
Dimensioning multicast-enabled communications networks
2002,
This paper concerns the network design problem of dimensioning capacity, available in...
Exact algorithms for minimum routing cost trees
Exact algorithms for minimum routing cost trees
2002,
Given a set of points and distances between them, a basic problem in network design...
Perturbing nonnormal confidential attributes: The copula approach
Perturbing nonnormal confidential attributes: The copula approach
2002,
Protecting confidential, numerical data in databases from disclosure is an important...
David vs. Goliath: An analysis of asymmetric mixed-strategy games and experimental evidence
David vs. Goliath: An analysis of asymmetric mixed-strategy games and experimental evidence
2002,
Mixed strategies are widely used to model strategic situations in diverse fields such...
Gale–Shapley stable marriage problem revisited: Strategic issues and applications
Gale–Shapley stable marriage problem revisited: Strategic issues and applications
2001,
We study strategic issues in the Gale–Shapley stable marriage model. In the...
Games of simple pursuit and approach on a two-dimensional cone
Games of simple pursuit and approach on a two-dimensional cone
1998,
The complete solution of two differential games with simple motion on a...
Using a Bayesian approach to quantify scale compatibility bias
Using a Bayesian approach to quantify scale compatibility bias
2002,
This paper proposes a new analytical framework to quantify and correct for scale...
Papers per page: