Results 91 to 100 of about 63,688 (308)
Research on a new multiobjective combinatorial optimization algorithm [PDF]
An real world engineering design problem is usually with multiple conflicting objectives, and it is easily lead to the difficulty to optimize these objectives at the same time. Multiobjective combinatorial optimization is not only an open theory problem,
Qin YF(秦永法), Zhao MY(赵明扬)
core +2 more sources
State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems
A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure.
Xiaoxia Han +3 more
doaj +1 more source
Combinatorial optimization with 2-joins
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs closed under taking induced subgraphs, such as perfect graphs and claw-free graphs. In this paper we construct combinatorial polynomial time algorithms for finding a maximum weighted clique, a maximum weighted stable set and an optimal coloring for a class ...
Trotignon, Nicolas, Kristina, Vuskovic
openaire +6 more sources
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
This paper presents a technique to minimize the number of test cases in configuration-aware structural testing. Combinatorial optimization is used first to generate an optimized test suite by sampling the input configuration.
Bestoun S. Ahmed
doaj +1 more source
Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
Combinatorial optimization tolerances calculated in linear time [PDF]
For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and ...
Goldengorin, Boris, Sierksma, Gerard
core +1 more source
A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks [PDF]
In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented.
Jose Aguilar, Miguel Labrador
doaj
Embryo‐like structures (stembryos) are an innovative tool, but they are hindered by experimental variability and limited developmental potential. DNA methylation is crucial for mammalian development, but its status in stembryo models is poorly characterized.
Sara Canil +4 more
wiley +1 more source
Combinatorial Optimization Problems Arising from Interactive Congestion Situations [PDF]
The purpose of this chapter is to survey the research area of game theory applied to congestion situations, where a group of autonomous agents, interacting in a discrete system that underlies various types of combinatorial optimization problems, try to ...
Gourvès, Laurent, Moretti, Stefano
core

