Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: combinatorial analysis
Found
435 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Geometric duality and combinatorial optimization
1992,
Junger Michael
Many combinatorial optimization problems have natural geometric versions, that is,...
A randomized algorithm for finding a near-maximum clique and its experimental evaluations
1993,
Takahashi Haruhisa
The so-called Maximum Clique Problem is one of the most famous NP-complete problems...
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets
1993,
Fischetti Matteo
Given any family ℱ of valid inequalities for the asymmetric traveling salesman...
On the complexity of the process shop
1994,
Ratliff H. Donald
The authors consider the problem of scheduling a two-stage processing system where...
Heuristic methods for arranging blades to minimize rotor unbalance
1993,
Sinclair M.
Rotor unbalance in turbomachinery is minimized by allocating rotor blades to specific...
A searching technique!
1993,
Little J.
Constraint Handling languages have become synonymous with the solution of traditional...
O(n) algorithms for load balancing in distributed computing systems
1994,
Gavish Bezalel
The problem of optimally balancing a given workload among identical processors with...
Comparison of the performance of modern heuristics for combinatorial optimization on real data
1993,
Sinclair Marius
Until recently most heuristics for combinatorial optimization problems could be...
Random walk and the area below its path
1993,
Harel Arie
A simple random walk with reflected origin is considered. The walk starts at the...
The Frobenius problem and maximal lattice free bodies
1993,
Shallcross David F.
Let p=(p 1 ,...,p n ) be a vector of positive integers whose greatest common divisor...
A note on resolving infeasibility in linear programs by constraint relaxation
1993,
Sankaran Jayaram K.
The paper studies the problem of finding a set of constraints of minimum cardinality...
Referee assignment for volleyball championships: A competition between three local search heuristics
1992,
Liebling Th.M.
The authors model the problem of assigning referees to matches of volleyball...
Games on a graph
1992,
Berge Claude
This paper is a survey of the various results obtained for combinatorial games, in...
Solving real-life vehicle routing problems efficiently using tabu search
1993,
Semet Frdric
This paper presents a tabu search based method for finding good solutions to a...
Solving a cutting-stock problem with the constraint logic programming language CHIP
1992,
Dincbas M.
CHIP is a new constraint logic programming language combining the declarative aspect...
Convex tree realizations of partitions
1992,
Dress Andreas
Given a collection P of partitions of a label set L a problem arising in biological...
Linear complementarity and oriented matroids
1992,
Fukuda Komei
A combinatorial abstraction of the linear complementarity theory in the setting of...
Geometrical solution to some planar constrained minimax problems involving the weighted rectilinear metric
1992,
Chakrabarty N.R.
The problem of locating a single service centre catering to the demands of customers...
On the computational complexity of (maximum) class scheduling
1991,
Kroon Leo G.
In this paper the authors consider several generalizations of the Fixed Job Scheduling...
The parallel-machine common due-date assignment and scheduling problem is NP-hard
1992,
Cheng T.C.E.
In a recent paper, Cheng studied the problem of assigning a common due-date to a set...
General local search heuristics in combinatorial optimization: A tutorial
1992,
Pirlot Marc
The paper presents four general heuristic search strategies that can in principle be...
Simulated annealing improving nuclear fuel manufacturing
1992,
Minguet C.
The homogenization of the characteristics of various assemblies of components used for...
The capacity of the subarray partial concentrators
1992,
Hwang F.K.
A partial concentrator with parameters n,m, and c , is an n (inputs)× m...
Clique-web facets for multicut polytopes
1992,
Deza M.
Let be a graph. An edge set , where is a partition of V , is called a multicut with k...
First Page
13
14
15
16
17
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers