Keyword: combinatorial analysis

Found 435 papers in total
A polynomial-time algorithm to find an equitable home–away assignment
A polynomial-time algorithm to find an equitable home–away assignment
2005,
We propose a polynomial-time algorithm to find an equitable home–away assignment...
Approximately-strategyproof and tractable multiunit auctions
Approximately-strategyproof and tractable multiunit auctions
2005,
We present an approximately-efficient and approximately-strategyproof auction...
Lower and upper bounding strategies for the network disconnection problem
Lower and upper bounding strategies for the network disconnection problem
2004,
The network disconnection problem is to find a set of edges such that the total cost...
An empirical data driven optimization approach by simulating human learning processes
An empirical data driven optimization approach by simulating human learning processes
2004,
This study suggests a data driven optimization approach, which simulates the models of...
On complexity of unconstrained hyperbolic 0–1 programming problems
On complexity of unconstrained hyperbolic 0–1 programming problems
2005,
Single- and multiple-ratio unconstrained hyperbolic 0–1 programming problems are...
Optimization with additional variables and constraints
Optimization with additional variables and constraints
2005,
Norton, Plotkin and Tardos proved that, loosely spoken, an LP problem is solvable in...
Group technology by an ant system algorithm
Group technology by an ant system algorithm
2005,
Clustering of items to form meaningful groups is a theoretically challenging problem....
An optimal rounding gives a better approximation for scheduling unrelated machines
An optimal rounding gives a better approximation for scheduling unrelated machines
2005,
A polynomial-time algorithm is suggested for non-preemptive scheduling of n...
Optimal preemptive scheduling on a fixed number of identical parallel machines
Optimal preemptive scheduling on a fixed number of identical parallel machines
2005,
In this paper, we consider the preemptive scheduling problem on a fixed number of...
The complexity of machine scheduling for stability with a single disrupted job
The complexity of machine scheduling for stability with a single disrupted job
2005,
A stable schedule is a robust schedule that will change little when uncertain events...
General Motors optimizes its scheduling of cold-weather tests
General Motors optimizes its scheduling of cold-weather tests
2004,
The General Motors Cold Weather Development Center is responsible for performing...
On some interconnections between combinatorial optimization and extremal graph theory
On some interconnections between combinatorial optimization and extremal graph theory
2004,
The uniting feature of combinatorial optimization and extremal graph theory is that in...
Betting Boolean-style: a framework for trading in securities based on logical formulas
Betting Boolean-style: a framework for trading in securities based on logical formulas
2005,
We develop a framework for trading in compound securities: financial instruments that...
Approximation of the supply scheduling problem
Approximation of the supply scheduling problem
2005,
The supply scheduling problem consists in finding a minimum cost delivery plan from a...
Two-machine flow shop scheduling problems with no-wait jobs
Two-machine flow shop scheduling problems with no-wait jobs
2005,
In this paper we provide a fairly complete complexity classification of various...
The m-machine flowshop problem with unit-time operations and intree precedence constraints
The m-machine flowshop problem with unit-time operations and intree precedence constraints
2005,
We consider the flowshop problem with unit-time operations and intree precedence...
Minimizing flow time on a constant number of machines with preemption
Minimizing flow time on a constant number of machines with preemption
2005,
We consider offline algorithms for minimizing the total flow time on O(1) machines...
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
2005,
This paper addresses cyclic hoist scheduling in a no-wait electroplating line where a...
Inapproximability results for no-wait job shop scheduling
Inapproximability results for no-wait job shop scheduling
2004,
We investigate the approximability of the no-wait job shop scheduling problem under...
On the complexity of the car sequencing problem
On the complexity of the car sequencing problem
2004,
In this note we give an easier proof of the known result that the car sequencing...
Asymptotic properties of random multidimensional assignment problems
Asymptotic properties of random multidimensional assignment problems
2004,
The multidimensional assignment problem (MAP) is an NP-hard combinatorial optimization...
Finding odd cycle transversals
Finding odd cycle transversals
2004,
We present an O( mn ) algorithm to determine whether a graph G with m edges and n...
A better approximation algorithm for the budget prize collecting tree problem
A better approximation algorithm for the budget prize collecting tree problem
2004,
Given an undirected graph G=(V,E) , an edge cost c(e)⩾0 for each edge e...
A solution to mean delay in the ∑Mc/Gck/1 cyclic priority queue with cycle (k) and class (c) dependent feedback and service times
A solution to mean delay in the ∑Mc/Gck/1 cyclic priority queue with cycle (k) and class (c) dependent feedback and service times
1999,
In this paper we develop an original solution to mean delay in a general ∑ M c /G...
Papers per page: