Results 1  10
of
1,997,438
Accessed from Metaheuristics and Combinatorial Optimization Problems
, 2006
"... Metaheuristics and combinatorial optimization problems ..."
On Solving Combinatorial Optimization Problems
, 2002
"... We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NPequivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP ..."
Abstract
 Add to MetaCart
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NPequivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP
Combinatorial Optimization Problems
, 2013
"... Maximization or minimization problems in which, for each input there is a set of feasible solutions and, for each solution there is a cost associated with it. As an example, lets take the Steiner Tree problem. LOCo/IC/UNICAMP – December 13th, 2013 – OCFL – Felice, M.C.S. 2/28 Combinatorial Optimizat ..."
Abstract
 Add to MetaCart
Maximization or minimization problems in which, for each input there is a set of feasible solutions and, for each solution there is a cost associated with it. As an example, lets take the Steiner Tree problem. LOCo/IC/UNICAMP – December 13th, 2013 – OCFL – Felice, M.C.S. 2/28 Combinatorial
Metaheuristics and Combinatorial Optimization Problems
"... The final copy of this thesis has been examined by the signatories, and we find that both the content and the form meet acceptable presentation standards of scholarly work in the above mentioned discipline. iii Scriptor, Gerald Skidmore (M.S., C.S.) Metaheuristics and Combinatorial Optimization Prob ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The final copy of this thesis has been examined by the signatories, and we find that both the content and the form meet acceptable presentation standards of scholarly work in the above mentioned discipline. iii Scriptor, Gerald Skidmore (M.S., C.S.) Metaheuristics and Combinatorial Optimization
GRAPHTHEORETIC STUDIES OF COMBINATORIAL OPTIMIZATION PROBLEMS
, 2013
"... Graphtheoretic studies of combinatorial optimization problems ..."
Minimum entropy combinatorial optimization problems
 Proceedings of the 5th Conference on Computability in Europe (CiE 2009
, 2009
"... We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems. 1 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems. 1
Combinatorial Optimization Problems
, 2014
"... Maximization or minimization problems in which, for each input there is a set of feasible solutions and, for each solution there is a cost associated with it. In this presentation we will focus on the Unconstrained Submodular Maximization problem (USM). This is one of the most basic submodular optim ..."
Abstract
 Add to MetaCart
optimization problems, that captures some well known problems as MaxCut and MaxDiCut.
An Evolutionary Approach to Combinatorial Optimization Problems
 PROCEEDINGS OF THE 22ND ANNUAL ACM COMPUTER SCIENCE CONFERENCE
, 1994
"... The paper reports on the application of genetic algorithms, probabilistic search algorithms based on the model of organic evolution, to NPcomplete combinatorial optimization problems. In particular, the subset sum, maximum cut, and minimum tardy task problems are considered. Except for the fitness ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
The paper reports on the application of genetic algorithms, probabilistic search algorithms based on the model of organic evolution, to NPcomplete combinatorial optimization problems. In particular, the subset sum, maximum cut, and minimum tardy task problems are considered. Except for the fitness
Results 1  10
of
1,997,438