Keyword: combinatorial optimization

Found 3184 papers in total
The undirected m-peripatetic salesman problem: polyhedral results and new algorithms
The undirected m-peripatetic salesman problem: polyhedral results and new algorithms
2007,
In the m-peripatetic salesman problem (m-PSP), the aim is to determine m edge disjoint...
Bound sets for biobjective combinatorial optimization problems
Bound sets for biobjective combinatorial optimization problems
2007,
In this paper we introduce the concept of bound sets for multiobjective discrete...
Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem
Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem
2007,
The growing amount of waste created by products reaching the end of their useful lives...
Heuristics for a coupled-operation scheduling problem
Heuristics for a coupled-operation scheduling problem
2007,
In this paper, we study a strongly NP-hard single machine scheduling problem in which...
Modeling leakage power reduction in VLSI as optimization problems
Modeling leakage power reduction in VLSI as optimization problems
2007,
Reducing power dissipation is one of the most important issues in VLSI design today....
Minimizing information loss and preserving privacy
Minimizing information loss and preserving privacy
2007,
The need to hide sensitive information before sharing databases has long been...
Variable neighbourhood search for redundancy allocation problems
Variable neighbourhood search for redundancy allocation problems
2007,
A variable neighbourhood search (VNS) algorithm has been developed to solve the...
Computational approaches to a combinatorial optimization problem arising from text classification
Computational approaches to a combinatorial optimization problem arising from text classification
2007,
We present a combinatorial optimization problem with a particular cost structure: a...
Approximation algorithms for extensible bin packing
Approximation algorithms for extensible bin packing
2006,
In a variation of bin packing called extensible bin packing, the number of bins is...
Colour map design through optimization
Colour map design through optimization
2007,
Often in engineering systems, full-colour images have to be displayed on limited...
Heuristic for a new multiobjective scheduling problem
Heuristic for a new multiobjective scheduling problem
2007,
We consider a telecommunication problem in which the objective is to schedule data...
On the complexity of adjacent resource scheduling
On the complexity of adjacent resource scheduling
2006,
We study the problem of scheduling resource(s) for jobs in an adjacent manner (ARS)....
An effective hybrid algorithm for university course timetabling
An effective hybrid algorithm for university course timetabling
2006,
The university course timetabling problem is an optimisation problem in which a set of...
A simulated annealing approach to the traveling tournament problem
A simulated annealing approach to the traveling tournament problem
2006,
Automating the scheduling of sport leagues has received considerable attention in...
Economic metaphors for solving intrafirm allocation problems: What does a market buy us?
Economic metaphors for solving intrafirm allocation problems: What does a market buy us?
2006,
The primary advantage of using simulated internal markets to solve complex resource...
Grouping of PCB assembly jobs in the case of flexible feeder units
Grouping of PCB assembly jobs in the case of flexible feeder units
2005,
Change costs between jobs in printed circuit board assembly depend on the number of...
A software framework for fast prototyping of meta-heuristics hybridization
A software framework for fast prototyping of meta-heuristics hybridization
2007,
Hybrids of meta-heuristics have been shown to be more effective and adaptable than...
Deterministic systems: graphic approach to combinatorial optimization
Deterministic systems: graphic approach to combinatorial optimization
2007,
Consideration was given to a graphic realization of the method of dynamic programming....
The cycle roommates problem: a hard case of kidney exchange
The cycle roommates problem: a hard case of kidney exchange
2007,
Recently, a number of interesting algorithmic problems have arisen from the emergence,...
Simple algorithms for Gilmore–Gomory's traveling salesman and related problems
Simple algorithms for Gilmore–Gomory's traveling salesman and related problems
2003,
We reconsider the version of the traveling salesman problem (TSP) first studied in a...
GASUB: finding global optima to discrete location problems by a genetic-like algorithm
GASUB: finding global optima to discrete location problems by a genetic-like algorithm
2007,
In many discrete location problems, a given number s of facility locations must be...
A spanning heuristic for the unordered and ordered matching identitication problem
A spanning heuristic for the unordered and ordered matching identitication problem
2005,
The matching identification problem (MIP) is a combinatoric search problem related to...
Large neighborhood improvements for solving car sequencing problems
Large neighborhood improvements for solving car sequencing problems
2006,
The NP -hard problem of car sequencing has received a lot of attention these last...
Nonconvex structures in nonlinear programming
Nonconvex structures in nonlinear programming
2004,
Nonsmoothness and nonconvexity in optimization problems often arise because a...
Papers per page: