• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 124,524
Next 10 →

Accessed from Metaheuristics and Combinatorial Optimization Problems

by Gerald Skidmore Scriptor, Written Gerald Skidmore Scriptor, Peter Anderson, Phil White, Stanislaw P Radziszowski , 2006
"... Metaheuristics and combinatorial optimization problems ..."
Abstract - Add to MetaCart
Metaheuristics and combinatorial optimization problems

On Solving Combinatorial Optimization Problems

by Jian Yang , 2002
"... We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP-equivalent traveling salesman prob-lem (TSP), we naturally arrive to a conjecture that is closely related to the polynomial-time 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 NP-equivalent traveling salesman prob-lem (TSP), we naturally arrive to a conjecture that is closely related to the polynomial-time insolvability of TSP, and hence to the P −NP

Metaheuristics and Combinatorial Optimization Problems

by Gerald Skidmore Scriptor, Written Gerald Skidmore Scriptor, Peter Anderson, Phil White, Stanislaw P Radziszowski
"... 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

Minimum entropy combinatorial optimization problems

by Jean Cardinal, Samuel Fiorini - 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

Inapproximability of combinatorial optimization problems

by Luca Trevisan , 2004
"... ..."
Abstract - Cited by 33 (1 self) - Add to MetaCart
Abstract not found

Algorithms for Combinatorial Optimization Problems

by Zahra Naji-Azimi , 2010
"... ..."
Abstract - Add to MetaCart
Abstract not found

An Evolutionary Approach to Combinatorial Optimization Problems

by Sami Khuri, Thomas Bäck, Jörg Heitkötter - 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 NP-complete combinatorial optimization problems. In particular, the subset sum, maximum cut, and minimum tardy task problems are considered. Except for the fitness ..."
Abstract - Cited by 45 (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 NP-complete combinatorial optimization problems. In particular, the subset sum, maximum cut, and minimum tardy task problems are considered. Except for the fitness

Combinatorial optimization problems in self-assembly

by Leonard Adleman, Ashish Goel, Pablo Moisset De Espanés - In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , 2002
"... Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing. In this paper, we stud ..."
Abstract - Cited by 43 (4 self) - Add to MetaCart
study two combinatorial optimization problems related to efficient self-assembly of shapes in the Tile Assembly Model of self-assembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given

Metaheuristics for Dynamic Combinatorial Optimization Problems

by Shengxiang Yang , Yong Jiang , Trung T Hanh Nguyen
"... Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables, and/or constraints may change over time, and so solving DCOPs is a challenging task. Metaheu ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables, and/or constraints may change over time, and so solving DCOPs is a challenging task

Approximation thresholds for combinatorial optimization problems

by Uriel Feige - In Proceedings of the International Congress of Mathematicians , 2002
"... An NP-hard combinatorial optimization problem Π is said to have an approximation threshold if there is some t such that the optimal value of Π can be approximated in polynomial time within a ratio of t, and it is NP-hard to approximate it within a ratio better than t. We survey some of the known app ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
An NP-hard combinatorial optimization problem Π is said to have an approximation threshold if there is some t such that the optimal value of Π can be approximated in polynomial time within a ratio of t, and it is NP-hard to approximate it within a ratio better than t. We survey some of the known
Next 10 →
Results 1 - 10 of 124,524
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University