Results 61 to 70 of about 63,688 (308)
Algorithms, 2018 We consider one approach to formalize the Resource-Constrained Project Scheduling Problem (RCPSP) in terms of combinatorial optimization theory. The transformation of the original problem into combinatorial setting is based on interpreting each operation
Alexander A. Lazarev +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source
Combinatorial optimization problems with conflict graphs [PDF]
, 2009 Conflict graphs impose disjunctive constraints for pairs of jobs, items, edges or other objects in a combinatorial optimization problem. Equivalently, the feasible domain of the considered problem is restricted to stable sets in the given conflict graph.
Cafieri, S. +8 more
core
Differential evolution for permutation-based combinatorial problems [PDF]
, 2012 The chapter clarifies the differences between wide-sense combinatorial optimization and strict-sense combinatorial optimization and then presents a number of combinatorial problems encountered in practice.
Davendra, Donald David +1 more
core +1 more source
Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent
Results in PhysicsCombinatorial optimization has wide and high-value applications in many fields of science and industry, but solving general combinatorial optimization problems is non-deterministic polynomial time (NP) hard.
Xin Yi +5 more
doaj +1 more source
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Research, 2020 Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous ...
Husheng Wu, Renbin Xiao
doaj +1 more source
A Three-Stage Annealing Method Solving Slot-Placement Problems Using an Ising Machine
IEEE Access, 2021 Ising machines are promising alternatives to solve combinatorial optimization problems, which search for their quasi-optimal solutions with high speed and high accuracy.
Keisuke Fukada +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric supportive care clinical trials often involve multiple clinically important outcomes, complicating trial interpretation. Hierarchical composite endpoints (HCEs) provide a framework to integrate key outcomes according to clinical importance.
Willem H. Collier +11 more
wiley +1 more source
The bandpass problem: combinatorial optimization and library of problems [PDF]
, 2009 A combinatorial optimization problem, called the Bandpass Problem, is introduced. Given a rectangular matrix A of binary elements {0,1} and a positive integer B called the Bandpass Number, a set of B consecutive non-zero elements in any column is called ...
Babayev, Djangir A. +2 more
core +1 more source
Combinatorial Optimization with Competing Agents [PDF]
, 2016 This chapter deals with three specific studies conducted within the combinatorial optimization for competing agents (COCA) project. It also deals with optimization problems arising from the relationship between members of a social network.
Gourvès, Laurent +4 more
core +3 more sources