Showing 1 - 20 results of 88 for search 'constraints combinatorial optimization', query time: 0.10s Refine Results
  1. 1
  2. 2

    Hysteresis in Combinatorial Optimization Problems by Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar

    Published 2021-04-01
    “…Our WCSP framework also allows us to understand hysteresis more generally in combinatorial optimization problems, with or without a connection to physically occurring phenomena.…”
    Get full text
    Article
  3. 3
  4. 4

    Robust Combinatorial Optimization with Locally Budgeted Uncertainty by Goerigk, Marc, Lendl, Stefan

    Published 2021-05-01
    “…Budgeted uncertainty sets have been established as a major influence on uncertainty modeling for robust optimization problems. A drawback of such sets is that the budget constraint only restricts the global amount of cost increase that can be distributed by an adversary. …”
    Get full text
    Article
  5. 5

    Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization by Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka

    Published 2025-01-01
    “…Recently, several methods for efficiently solving constrained combinatorial optimization problems have been proposed by designing a quantum circuit so as to output only the states that satisfy the constraints. …”
    Get full text
    Article
  6. 6

    Quick design of feasible tensor networks for constrained combinatorial optimization by Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka

    Published 2025-07-01
    “…Particularly, tensor networks have been applied to constrained combinatorial optimization problems for practical applications. …”
    Get full text
    Article
  7. 7

    Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty by Omer, Jérémy, Poss, Michael, Rougier, Maxime

    Published 2024-09-01
    “…Given a nominal combinatorial optimization problem, we consider a robust two-stages variant with polyhedral cost uncertainty, called Decision-Dependent Information Discovery (DDID). …”
    Get full text
    Article
  8. 8

    UAV mission scheduling with completion time, flight distance, and resource consumption constraints by Keqin Li

    Published 2023-12-01
    “…Furthermore, UAV task scheduling should be studied within the traditional framework of combinatorial optimisation. In this paper, we consider optimal mission scheduling for heterogeneous UAVs with completion time, flight distance, and resource consumption constraints. …”
    Get full text
    Article
  9. 9

    Reinforcement Learning-Based Formulations With Hamiltonian-Inspired Loss Functions for Combinatorial Optimization Over Graphs by Redwan Ahmed Rizvee, Raheeb Hassan, Md. Mosaddek Khan

    Published 2024-01-01
    “…Quadratic Unconstrained Binary Optimization (QUBO) is a versatile approach used to represent a wide range of NP-hard Combinatorial Optimization (CO) problems through binary variables. …”
    Get full text
    Article
  10. 10

    Combinatorial Optimization of Service Order and Overtaking for Demand-Oriented Timetabling in a Single Railway Line by Dewei Li, Shishun Ding, Yizhen Wang

    Published 2018-01-01
    “…Demand-oriented train timetable optimization by minimizing travel time plays an important role in both theory and practice. …”
    Get full text
    Article
  11. 11

    Improved ant colony optimization algorithm for solving constraint satisfaction problem by HANGYong-gang Z, HANGSi-bo Z, UEQiu-shi X

    Published 2015-05-01
    “…The traditional backtracking algorithm was less efficient on solving large-scale constraint satisfaction problem,and more difficult to be solved within a reasonable time.In order to overcome this problem,many incompleteness algo-rithms based on heuristic search have been proposed.Two improvements based on ant colony optimization meta-heuristic constraint solving algorithm were presented:First,arc consistency checks was done to preprocess before exploring the search space,Second,a new parameter setting scheme was proposed for ant colony optimization to improve the effi-ciency of the search.Finally,the improved algorithm is applied to solve random problems and combinatorial optimization problems.The results of the experiment have showed its superiority.…”
    Get full text
    Article
  12. 12

    Quantum-Inspired Hyperheuristic Framework for Solving Dynamic Multi-Objective Combinatorial Problems in Disaster Logistics by Kassem Danach, Hassan Harb, Louai Saker, Ali Raad

    Published 2025-06-01
    “…In this context, we propose a novel Quantum-Inspired Hyperheuristic Framework (QHHF) designed to solve Dynamic Multi-Objective Combinatorial Optimization Problems (DMOCOPs) arising in disaster relief operations. …”
    Get full text
    Article
  13. 13

    Forgetful Swarm Optimization for Astronomical Observation Scheduling by Nariman Nakhjiri, Maria Salamo, Miquel Sanchez-Marre, Christian Blum, Juan Carlos Morales

    Published 2024-01-01
    “…In this paper, we propose a novel metaheuristic algorithm called Forgetful Swarm Optimization (FSO) for Astronomical Observation Scheduling (AOS), a type of combinatorial optimization problem defined by the tasks and constraints assigned to the telescopes and other devices involved in astrophysical research. …”
    Get full text
    Article
  14. 14

    Cons-training tensor networks: Embedding and optimization over discrete linear constraints by Javier Lopez-Piqueres, Jing Chen

    Published 2025-06-01
    “…Utilizing this canonical form, we apply an unsupervised training strategy to optimize arbitrary objective functions subject to discrete linear constraints. …”
    Get full text
    Article
  15. 15
  16. 16

    Robust Optimization for Cooperative Task Assignment of Heterogeneous Unmanned Aerial Vehicles with Time Window Constraints by Zhichao Gao, Mingfa Zheng, Haitao Zhong, Yu Mei

    Published 2025-03-01
    “…We conduct a series of numerical experiments to compare the optimization results across different objectives, including maximizing task profit, minimizing total distance, minimizing makespan, and incorporating three different time window constraints. …”
    Get full text
    Article
  17. 17
  18. 18
  19. 19
  20. 20

    Population-Based Redundancy Control in Genetic Algorithms: Enhancing Max-Cut Optimization by Yong-Hyuk Kim, Zong Woo Geem, Yourim Yoon

    Published 2025-04-01
    “…The max-cut problem is a well-known topic in combinatorial optimization, with a wide range of practical applications. …”
    Get full text
    Article