作者: 說(shuō)明 時(shí)間: 2025-3-21 22:17
On a?Geometric Graph-Covering Problem Related to?Optimal Safety-Landing-Site Location networks. We link our minimum-weight set-cover problems to efficiently-solvable cases of minimum-weight set covering that have been studied. We were able to solve large random instances to optimality using our modeling approach. We carried out ., a technique that generalizes reduced-cost fixing, an作者: 凌辱 時(shí)間: 2025-3-22 02:23 作者: 神圣在玷污 時(shí)間: 2025-3-22 06:09 作者: 不吉祥的女人 時(shí)間: 2025-3-22 11:17
Optimal Cycle Selections: An Experimental Assessment of?Integer Programming FormulationsSpecifically, we carry out experiments to identify a maximum weighted cycle selection in random or in structured digraphs. The results show that random instances are relatively easy and that two formulations outperform the other ones in terms of total running time. We also examine variants of the pr作者: 無(wú)法解釋 時(shí)間: 2025-3-22 13:14
1-Persistency of?the?Clique Relaxation of?the?Stable Set Polytoper each . with .. In this paper, we consider a relaxation of the persistency property, called 1-persistency, over the clique relaxation of the stable set polytope in graphs. In particular, we study the family . of graphs whose clique relaxation of the stable set polytope has 1-persistency. The main o作者: 無(wú)法解釋 時(shí)間: 2025-3-22 20:53 作者: HUMID 時(shí)間: 2025-3-22 22:57
Branch and?Cut for?Partitioning a?Graph into?a?Cycle of?Clustersth nonnegative arc weights that is used to identify cyclic behavior in simulation data generated from nonreversible Markov state models. Here, in addition to partitioning the vertices into a set of coherent clusters, the resulting clusters must be ordered into a cycle such as to maximize the total n作者: 無(wú)聊的人 時(shí)間: 2025-3-23 03:32 作者: 貪婪性 時(shí)間: 2025-3-23 07:00 作者: STEER 時(shí)間: 2025-3-23 11:28
Open-Separating Dominating Codes in?Graphsobjective is to choose a suitable dominating set . of a graph . such that the neighbourhoods of all vertices of . have distinct intersections with .. Such a dominating and separating set . is often referred to as a . in the literature. Depending on the types of dominating and separating sets used, v作者: 參考書目 時(shí)間: 2025-3-23 16:14
On the?Complexity of?the?Minimum Chromatic Violation Problem and .; the endpoints of a weak edge can be assigned to the same color and the . (MCVP) asks for a coloring of the graph minimizing the number of weak edges having its endpoints assigned to the same color. Previous works in the literature on MCVP focus on defining integer programming formulations an作者: MURKY 時(shí)間: 2025-3-23 20:45 作者: floodgate 時(shí)間: 2025-3-24 01:09 作者: MAIZE 時(shí)間: 2025-3-24 06:19 作者: Coma704 時(shí)間: 2025-3-24 08:37 作者: 積云 時(shí)間: 2025-3-24 12:12 作者: 祖?zhèn)髫?cái)產(chǎn) 時(shí)間: 2025-3-24 18:33
Competition Law and Policy in Small Statese characterize according formulations comprising facet-defining inequalities only. Trade-offs and comparisons to prevalent formulations concerning size and relaxation strength are subject to an experimental study.作者: 失敗主義者 時(shí)間: 2025-3-24 21:11 作者: amygdala 時(shí)間: 2025-3-25 01:30 作者: spinal-stenosis 時(shí)間: 2025-3-25 04:56
Cellular Automata and the Railway Model, . are fixed-parameter tractable parameterized by .. We use a dynamic programming approach and define a new dominance rule, which we call the weak earliest deadline rule. This rule narrows down the number of relevant scheduling prefixes enough to complete the search via a fixed-parameter tractable number of dynamic programming states.作者: 正常 時(shí)間: 2025-3-25 11:31
https://doi.org/10.1007/978-3-319-39366-7onstraint is imposed. To investigate the cycle selection problem with a maximum cycle length equal to 3, we provide an arc-based formulation with an exponential number of constraints that can be separated in polynomial time. All inequalities in the formulation are facet-defining for complete digraphs.作者: abstemious 時(shí)間: 2025-3-25 15:40
https://doi.org/10.1007/978-3-642-20766-2ed in the KEGG database by representing compounds as vertices, reactions as hyperedges, and metabolic pathways and networks as hypergraphs. We provide experimental results showing that metabolic pathways and networks with thousands of compounds and reactions can be oriented in a few seconds on a personal computer.作者: Ledger 時(shí)間: 2025-3-25 16:02
Optimal Cycle Selections: An Experimental Assessment of?Integer Programming Formulationsonstraint is imposed. To investigate the cycle selection problem with a maximum cycle length equal to 3, we provide an arc-based formulation with an exponential number of constraints that can be separated in polynomial time. All inequalities in the formulation are facet-defining for complete digraphs.作者: ABHOR 時(shí)間: 2025-3-26 00:01
Minimizing External Vertices in?Hypergraph Orientationsed in the KEGG database by representing compounds as vertices, reactions as hyperedges, and metabolic pathways and networks as hypergraphs. We provide experimental results showing that metabolic pathways and networks with thousands of compounds and reactions can be oriented in a few seconds on a personal computer.作者: ADORN 時(shí)間: 2025-3-26 01:28
Small States, Colonial Rule and Democracyd, we give two different infinite families of forbidden minimal structures for this class of graphs. We conclude the paper by suggesting an interesting future line of work about the persistency-preservation property of valid inequalities and its potential practical applications.作者: 露天歷史劇 時(shí)間: 2025-3-26 05:59 作者: exclusice 時(shí)間: 2025-3-26 11:56
,Jamaica’s Relations with China and Japan,al heuristics and separation routines for both formulations. In computational experiments on simulation data from biology we find that branch and cut based on the problem-specific formulation outperforms the one based on RLT.作者: Hyperalgesia 時(shí)間: 2025-3-26 13:17
https://doi.org/10.1007/978-3-322-87156-5 others. We show that MCVP is NP-hard for general graphs and it remains NP-hard when the graph induced by the strong edges is unit interval or distance hereditary. On the other side, we provide a polynomial algorithm that properly solves MCVP when the graph is a unit interval graph without triangles with two or more weak edges.作者: 玩笑 時(shí)間: 2025-3-26 18:13
https://doi.org/10.1007/978-3-322-87156-5ical results for crystal trees and an algebraic representation allowing us to describe MSTs by a system of linear inequalities. This opens up new possibilities for solving optimization problems with optimal tree structure in the set of constraints.作者: neutral-posture 時(shí)間: 2025-3-26 20:57
1-Persistency of?the?Clique Relaxation of?the?Stable Set Polytoped, we give two different infinite families of forbidden minimal structures for this class of graphs. We conclude the paper by suggesting an interesting future line of work about the persistency-preservation property of valid inequalities and its potential practical applications.作者: abstemious 時(shí)間: 2025-3-27 03:42
Alternating Direction Method and?Deep Learning for?Discrete Control with?Storagelti-start mechanism and prediction using scaling in the absence of a training set. Numerical experiments on the pump scheduling problem in water networks show the effectiveness of this hybrid learning/decomposition algorithm in computing near-optimal strict-feasible solutions in more reasonable times than other approaches.作者: Demonstrate 時(shí)間: 2025-3-27 08:49 作者: 開玩笑 時(shí)間: 2025-3-27 11:57 作者: 失眠癥 時(shí)間: 2025-3-27 16:26
Crystal Treesical results for crystal trees and an algebraic representation allowing us to describe MSTs by a system of linear inequalities. This opens up new possibilities for solving optimization problems with optimal tree structure in the set of constraints.作者: NAG 時(shí)間: 2025-3-27 19:24
0302-9743 na, Tenerife, Spain, during May 22–24, 2024...The 30 full papers included in this book were carefully reviewed and selected from 46 submissions. They were organized in topical sections as follows: integer programming; graph theory; parameterized algorithms; approximation algorithms; integer programm作者: 煩人 時(shí)間: 2025-3-28 01:23 作者: BOLUS 時(shí)間: 2025-3-28 02:55
On a?Geometric Graph-Covering Problem Related to?Optimal Safety-Landing-Site Locationable to solve large random instances to optimality using our modeling approach. We carried out ., a technique that generalizes reduced-cost fixing, and which we found to be very effective in reducing the size of our integer-programming instances.作者: enlist 時(shí)間: 2025-3-28 09:53
Conference proceedings 2024fe, Spain, during May 22–24, 2024...The 30 full papers included in this book were carefully reviewed and selected from 46 submissions. They were organized in topical sections as follows: integer programming; graph theory; parameterized algorithms; approximation algorithms; integer programming for ma作者: 亂砍 時(shí)間: 2025-3-28 13:35 作者: lymphoma 時(shí)間: 2025-3-28 15:21 作者: 類型 時(shí)間: 2025-3-28 21:26
Total Matching and?Subdeterminantserminant of a square submatrix of .. We show that the total matching problem can be solved in strongly polynomial time provided . for some constant .. We also show that the problem of computing . admits an FPT algorithm. We also establish further results on . when . is a forest.作者: 駭人 時(shí)間: 2025-3-28 23:44
A New Structural Parameter on?Single Machine Scheduling with?Release Dates and?Deadlines . are fixed-parameter tractable parameterized by .. We use a dynamic programming approach and define a new dominance rule, which we call the weak earliest deadline rule. This rule narrows down the number of relevant scheduling prefixes enough to complete the search via a fixed-parameter tractable number of dynamic programming states.作者: 草率男 時(shí)間: 2025-3-29 03:46 作者: 使入迷 時(shí)間: 2025-3-29 07:29
978-3-031-60923-7The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Glower 時(shí)間: 2025-3-29 13:33
On Disjunction Convex Hulls by?Liftingded-variable space . is given by full optimal big-M lifting (i) when . (and that it is not generally true for .), and also (ii) when the polytopes are all axis-aligned hyper-rectangles. We give further results on the polyhedral structure of ., emphasizing the role of full optimal big-M lifting.作者: temperate 時(shí)間: 2025-3-29 18:53
Conference proceedings 2024fe, Spain, during May 22–24, 2024...The 30 full papers included in this book were carefully reviewed and selected from 46 submissions. They were organized in topical sections as follows: integer programming; graph theory; parameterized algorithms; approximation algorithms; integer programming for machine learning; and applications..作者: 強(qiáng)所 時(shí)間: 2025-3-29 20:09 作者: anticipate 時(shí)間: 2025-3-30 02:52
The Foreign Policy Decision Environment,ded-variable space . is given by full optimal big-M lifting (i) when . (and that it is not generally true for .), and also (ii) when the polytopes are all axis-aligned hyper-rectangles. We give further results on the polyhedral structure of ., emphasizing the role of full optimal big-M lifting.作者: 配偶 時(shí)間: 2025-3-30 05:30
The Foreign Policy Decision Environment,ded-variable space . is given by full optimal big-M lifting (i) when . (and that it is not generally true for .), and also (ii) when the polytopes are all axis-aligned hyper-rectangles. We give further results on the polyhedral structure of ., emphasizing the role of full optimal big-M lifting.作者: conceal 時(shí)間: 2025-3-30 09:43
Jacqueline Anne Braveboy-Wagner networks. We link our minimum-weight set-cover problems to efficiently-solvable cases of minimum-weight set covering that have been studied. We were able to solve large random instances to optimality using our modeling approach. We carried out ., a technique that generalizes reduced-cost fixing, an作者: 摘要記錄 時(shí)間: 2025-3-30 16:27
Competition Law and Policy in Small Statesnding a subset . of maximum cardinality such that .[.] is a chordless cycle. We present a Quadratically Constrained reformulation for the CCP, derive a Semidefinite Programming (SDP) relaxation for it and solve that relaxation by Lagrangian Relaxation (LR). Compared to previously available dual boun作者: Pastry 時(shí)間: 2025-3-30 17:55 作者: FEIGN 時(shí)間: 2025-3-30 23:25
https://doi.org/10.1007/978-3-319-39366-7Specifically, we carry out experiments to identify a maximum weighted cycle selection in random or in structured digraphs. The results show that random instances are relatively easy and that two formulations outperform the other ones in terms of total running time. We also examine variants of the pr
