Showing 221 - 240 results of 1,584 for search '"Combinatorial optimization"', query time: 0.15s Refine Results
  1. 221
  2. 222
  3. 223
  4. 224

    A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One by Mittal, Shashi, Ph. D. Massachusetts Institute of Technology, Schulz, Andreas S

    Published 2015
    “…In this paper, we present a general framework for designing approximation schemes for combinatorial optimization problems in which the objective function is a combination of more than one function. …”
    Get full text
    Get full text
    Article
  5. 225

    A noisy chaotic neural network for solving combinatorial optimization problems : stochastic chaotic simulated annealing by Wang, Lipo., Fu, Xiuju, Li, Sa, Tian, Fuyu

    Published 2012
    “…Recently Chen and Aihara have demonstrated both experimentally and mathematically that their chaotic simulated annealing (CSA) has better search ability for solving combinatorial optimization problems compared to both the Hopfield-Tank approach and stochastic simulated annealing (SSA). …”
    Get full text
    Get full text
    Journal Article
  6. 226
  7. 227
  8. 228
  9. 229
  10. 230
  11. 231
  12. 232
  13. 233

    Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems by E. Osaba, R. Carballedo, F. Diaz, E. Onieva, I. de la Iglesia, A. Perallos

    Published 2014-01-01
    “…Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. …”
    Get full text
    Article
  14. 234

    Enhanced convergence in p-bit based simulated annealing with partial deactivation for large-scale combinatorial optimization problems by Naoya Onizawa, Takahiro Hanyu

    Published 2024-01-01
    “…Abstract This article critically investigates the limitations of the simulated annealing algorithm using probabilistic bits (pSA) in solving large-scale combinatorial optimization problems. The study begins with an in-depth analysis of the pSA process, focusing on the issues resulting from unexpected oscillations among p-bits. …”
    Get full text
    Article
  15. 235
  16. 236
  17. 237
  18. 238

    Hybrid Parallel Ant Colony Optimization for Application to Quantum Computing to Solve Large-Scale Combinatorial Optimization Problems by Bishad Ghimire, Ausif Mahmood, Khaled Elleithy

    Published 2023-10-01
    “…The technique is based on unitary evolution using a Hamiltonian encoding of the objective function of the combinatorial optimization problem. The QAOA was explored in the context of several optimization problems such as the Max-Cut problem and the Traveling Salesman Problem (TSP). …”
    Get full text
    Article
  19. 239
  20. 240