Keyword: combinatorial optimization

Found 3184 papers in total
The just‐in‐time scheduling problem in a flow‐shop scheduling system
The just‐in‐time scheduling problem in a flow‐shop scheduling system
2012,
We study the problem of maximizing the weighted number of just‐in‐time (...
Approximation algorithms for the parallel flow shop problem
Approximation algorithms for the parallel flow shop problem
2012,
We consider the NP ‐hard problem of scheduling n jobs in m two‐stage...
Adaptive policies for multi‐mode project scheduling under uncertainty
Adaptive policies for multi‐mode project scheduling under uncertainty
2012,
In this paper we propose an adaptive model for multi‐mode project scheduling...
Mobile phone tower location for survival after natural disasters
Mobile phone tower location for survival after natural disasters
2012,
This paper discusses the location or strengthening of cell phone towers so as to...
Ancient and New Algorithms for Load Balancing in the lp Norm
Ancient and New Algorithms for Load Balancing in the lp Norm
2001,
We consider the on‐line load balancing problem where there are m identical...
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix
2001,
This paper is concerned with the problem of computing the characteristic polynomial of...
A Generalization of a Lower Bound Technique due to Fredman and Saks
A Generalization of a Lower Bound Technique due to Fredman and Saks
2001,
In a seminal paper of 1989, Fredman and Saks proved lower bounds for some important...
On Rooted Node‐Connectivity Problems
On Rooted Node‐Connectivity Problems
2001,
Let G be a graph which is k ‐outconnected from a specified root node r , that...
On‐Line Competitive Algorithms for Call Admission in Optical Networks
On‐Line Competitive Algorithms for Call Admission in Optical Networks
2001,
We study the on‐line call admission problem in optical networks. We present a...
Permutation Routing on Reconfigurable Meshes
Permutation Routing on Reconfigurable Meshes
2001,
In this paper we present efficient algorithms for packet routing on the reconfigurable...
Approximation Algorithms for Degree‐Constrained Minimum‐Cost Network‐Design Problems
Approximation Algorithms for Degree‐Constrained Minimum‐Cost Network‐Design Problems
2001,
We study network‐design problems with two different design objectives: the...
Lopsided Trees, I: Analyses
Lopsided Trees, I: Analyses
2001,
Lopsided trees are rooted, ordered trees in which the length of an edge from a node to...
Average Profile of the Lempel‐Ziv Parsing Scheme for a Markovian Source
Average Profile of the Lempel‐Ziv Parsing Scheme for a Markovian Source
2001,
For a Markovian source, we analyze the Lempel–Ziv parsing scheme that partitions...
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
2001,
Updating a minimum spanning tree (MST) is a basic problem for communication networks....
Partitioning a Square into Rectangles: NP‐Completeness and Approximation Algorithms
Partitioning a Square into Rectangles: NP‐Completeness and Approximation Algorithms
2002,
In this paper we deal with two geometric problems arising from heterogeneous parallel...
Communication–Processor Tradeoffs in a Limited Resources PRAM
Communication–Processor Tradeoffs in a Limited Resources PRAM
2002,
We consider a simple restriction of the PRAM model (called PPRAM), where the input is...
Approximation Algorithms for Access Network Design
Approximation Algorithms for Access Network Design
2002,
We consider the problem of designing a minimum cost access network to carry traffic...
Planar Graph Blocking for External Searching
Planar Graph Blocking for External Searching
2002,
We present a new scheme for storing a planar graph in external memory so that any...
A stochastic model for the daily coordination of pumped storage hydro plants and wind power plants
A stochastic model for the daily coordination of pumped storage hydro plants and wind power plants
2012,
We propose a stochastic model for the daily operation scheduling of a generation...
Stochastic optimization for real time service capacity allocation under random service demand
Stochastic optimization for real time service capacity allocation under random service demand
2012,
The problem of repeated allocation of limited renewable service resources to...
A stochastic programming model for the optimal electricity market bid problem with bilateral contracts for thermal and combined cycle units
A stochastic programming model for the optimal electricity market bid problem with bilateral contracts for thermal and combined cycle units
2012,
This paper develops a stochastic programming model that integrates the most recent...
Analysis of a two‐party supply chain with random disruptions
Analysis of a two‐party supply chain with random disruptions
2012,
We study a continuous‐review inventory problem of a two‐echelon supply...
Sell or Hold: A simple two‐stage stochastic combinatorial optimization problem
Sell or Hold: A simple two‐stage stochastic combinatorial optimization problem
2012,
The sell or hold problem (SHP) is to sell k out of n indivisible assets over two...
Price of anarchy for supply chains with partial positive externalities
Price of anarchy for supply chains with partial positive externalities
2012,
We consider the impact of partial positive externalities (imperfect complementarity)...
Papers per page: