標(biāo)題: Titlebook: Combinatorial Optimization; 7th International Sy Ivana Ljubi?,Francisco Barahona,A. Ridha Mahjoub Conference proceedings 2022 The Editor(s) [打印本頁] 作者: Polk 時(shí)間: 2025-3-21 16:12
書目名稱Combinatorial Optimization影響因子(影響力)
作者: 上下連貫 時(shí)間: 2025-3-21 20:29 作者: 縮減了 時(shí)間: 2025-3-22 03:54 作者: GULF 時(shí)間: 2025-3-22 06:03
,Switzerland’s Integration Policy,rallel versions. Our results highlight that opportunistic versions perform better in terms of wall clock times, while the deterministic versions avoid detrimental anomalies with theoretically established guarantees and also provide reproducible results, a feature that is desirable while developing p作者: 嗎啡 時(shí)間: 2025-3-22 11:13
Alice Cunha,Baldur Thorhallssonn the total cost and the max-min distance is considered to be fair if the percentage increase in the total cost is smaller than the percentage decrease in the max-min distance and vice versa..We first show the existence of a NF solution for the AP which is exactly the optimal solution minimizing the作者: 放肆的你 時(shí)間: 2025-3-22 14:50 作者: 放肆的你 時(shí)間: 2025-3-22 17:24 作者: chance 時(shí)間: 2025-3-22 21:14
Compressible (Low-Mach) Two-Phase Flows,reover, we investigate the related polyhedron and describe several valid inequalities. We also devise separation routines for these inequalities. Based on this, we propose a Branch-and-Cut algorithm for the problem along with an extensive computational study showing the effectiveness of our approach.作者: 農(nóng)學(xué) 時(shí)間: 2025-3-23 03:38 作者: 圓錐 時(shí)間: 2025-3-23 08:01
Why Start a Small Spacecraft Program, of .. We show that the extension complexity of . can increase exponentially if . even if the vertices of . contain only three values, say 0,?1,? or 2 at each of the coordinates . for .. Furthermore, the extension complexity of . can be exponentially larger than that of .. We also discuss the implications for the 0/1 case.作者: 極為憤怒 時(shí)間: 2025-3-23 11:16
The Concept of Military Alliance, the players’ weights. Methodologically, we obtain exact price of anarchy bounds by a duality-based proof mechanism, based on a compact linear programming formulation that computes worst-case instances. This mechanism yields duality-based optimality certificates, which can eventually be turned into purely algebraic proofs.作者: Generalize 時(shí)間: 2025-3-23 17:13
The Constrained-Routing and?Spectrum Assignment Problem: Valid Inequalities and?Branch-and-Cut Algorreover, we investigate the related polyhedron and describe several valid inequalities. We also devise separation routines for these inequalities. Based on this, we propose a Branch-and-Cut algorithm for the problem along with an extensive computational study showing the effectiveness of our approach.作者: BIBLE 時(shí)間: 2025-3-23 18:03 作者: Ovulation 時(shí)間: 2025-3-24 00:42 作者: 煩人 時(shí)間: 2025-3-24 02:52
Exact Price of?Anarchy for?Weighted Congestion Games with?Two Players the players’ weights. Methodologically, we obtain exact price of anarchy bounds by a duality-based proof mechanism, based on a compact linear programming formulation that computes worst-case instances. This mechanism yields duality-based optimality certificates, which can eventually be turned into purely algebraic proofs.作者: 潰爛 時(shí)間: 2025-3-24 09:02
0302-9743 CO 2022, which was held online during May 18–20, 2022..The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows:?Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; g作者: delusion 時(shí)間: 2025-3-24 13:54 作者: 向外 時(shí)間: 2025-3-24 15:04
New Classes of?Facets for?Complementarity Knapsack Problems Sufficient conditions for these inequalities to be facet-defining, based on the concept of a ., are also provided. Moreover, we answer positively a conjecture by De Farias et?al. about the separation complexity of the inequalities introduced in their work.作者: 微粒 時(shí)間: 2025-3-24 21:02 作者: 聯(lián)想記憶 時(shí)間: 2025-3-25 00:15 作者: ROOF 時(shí)間: 2025-3-25 07:08
Valentina Manente,Silvio Caputoematical formulations of the top-. list aggregation problem under the generalized Kendall tau distance. Furthermore, the strength of the proposed formulations is analyzed from a polyhedral point of view.作者: Serenity 時(shí)間: 2025-3-25 10:27 作者: 矛盾 時(shí)間: 2025-3-25 14:06 作者: 拘留 時(shí)間: 2025-3-25 18:00
Few Induced Disjoint Paths for?,-Free Graphstates that even 2-. is .-complete. We prove new complexity results for .-. if the input is restricted to .-free graphs, that is, graphs without a fixed graph . as an induced subgraph. We compare our results with a complexity dichotomy for ., the variant where . is part of the input.作者: STRIA 時(shí)間: 2025-3-25 20:42
,Multiscale Euler–Lagrange Coupling, time, discuss the experimental behaviour of the related Branch-and-Cut algorithm and briefly address the lift issue to turn an optimal solution of our projected model into a solution of the original problem.作者: 頌揚(yáng)本人 時(shí)間: 2025-3-26 00:29 作者: 種類 時(shí)間: 2025-3-26 04:52 作者: 潛移默化 時(shí)間: 2025-3-26 10:32
On Minimally Non-firm Binary Matricesralised binary matrices and use these operations to derive four infinite classes of minimally non-firm matrices. We hope that our work may pave the way towards a complete characterisation of firm matrices via forbidden submatrices.作者: frivolous 時(shí)間: 2025-3-26 13:34
New Classes of?Facets for?Complementarity Knapsack Problemstudies of De Farias et?al. for CKP, by proposing three new families of cutting-planes that are all obtained from a combinatorial concept known as a .. Sufficient conditions for these inequalities to be facet-defining, based on the concept of a ., are also provided. Moreover, we answer positively a c作者: 允許 時(shí)間: 2025-3-26 20:07
Branch-and-Cut for?a?2-Commodity Flow Relocation Model with?Time Constraintse model involves an integral flow which represents carriers together with an integral flow which represents the objects transported by those carriers. It may be viewed as the projection on the transit network of a flow model formulated on a time expanded network which simultaneously copes with tempo作者: murmur 時(shí)間: 2025-3-27 00:41 作者: 無畏 時(shí)間: 2025-3-27 03:18
Top-, List Aggregation: Mathematical Formulations and?Polyhedral Comparisonsystems. Since multiple top-. lists may be generated by different algorithms to evaluate the same set of entities or system of interest, there is often a need to consolidate this collection of heterogeneous top-. lists to obtain a more robust and coherent list. This work introduces various exact math作者: 有效 時(shí)間: 2025-3-27 07:08 作者: cacophony 時(shí)間: 2025-3-27 13:13 作者: LEVY 時(shí)間: 2025-3-27 17:07
Few Induced Disjoint Paths for?,-Free Graphs-. problem is to decide if a graph?. with . pairs of specified vertices . contains . mutually induced paths?. such that each . starts from . and ends at?.. Whereas the non-induced version is well-known to be polynomial-time solvable for every fixed integer ., a classical result from the literature s作者: osculate 時(shí)間: 2025-3-27 19:43 作者: 追蹤 時(shí)間: 2025-3-27 23:12
Piecewise Linearization of?Bivariate Nonlinear Functions: Minimizing the?Number of?Pieces Under a?Botion error. Applications include the approximation of mixed integer nonlinear optimization problems into mixed integer linear ones that are in general easier to solve. A framework to build dedicated linearization algorithms is introduced, and a comparison to the state of the art heuristics shows the作者: Dealing 時(shí)間: 2025-3-28 05:57
Mitigating Anomalies in?Parallel Branch-and-Bound Based Algorithms for?Mixed-Integer Nonlinear Optimar branch-and-bound (.) and the LP/NLP based branch-and-bound (.). A detrimental anomaly is when a parallel algorithm performs worse than its sequential counterpart. Unambiguous node selection functions have been developed in the past to avoid these anomalies. We extend this notion of unambiguity to作者: COMMA 時(shí)間: 2025-3-28 07:34
Exact Price of?Anarchy for?Weighted Congestion Games with?Two Playersions. The results are exact price of anarchy bounds, which are parametric in the weights of the two players, and establish exactly how the attributes of the game enter into the quality of equilibria. Interestingly, some of the worst-cases are attained when the players’ weights only differ slightly. 作者: 桶去微染 時(shí)間: 2025-3-28 14:11 作者: 激怒某人 時(shí)間: 2025-3-28 18:21
On the?Thinness of?Treeslgorithmic use has also been increasing [Cygan?et?al., 2015]. New width parameters continue to be defined, for example, mim-width in 2012, twin-width in 2020, and mixed-thinness, a generalization of thinness, in 2022..The concept of . of a graph was introduced in 2007 by Mannino, Oriolo, Ricci and C作者: 厭煩 時(shí)間: 2025-3-28 20:02 作者: Albumin 時(shí)間: 2025-3-28 23:29 作者: 明確 時(shí)間: 2025-3-29 06:06 作者: 構(gòu)成 時(shí)間: 2025-3-29 07:35 作者: Fresco 時(shí)間: 2025-3-29 15:13 作者: Protein 時(shí)間: 2025-3-29 18:36
Israel: The Case for Ambiguity,We apply the well-known MINLO outer-approximation algorithm (OA) to the maximum-entropy sampling problem (MESP), using the linx and NLP convex relaxations for MESP. We enhance our approach using disjunctive cuts.作者: PON 時(shí)間: 2025-3-29 21:45 作者: Engulf 時(shí)間: 2025-3-30 03:52
Albrecht Kaupp PhD,John R. Goss M. S.tudies of De Farias et?al. for CKP, by proposing three new families of cutting-planes that are all obtained from a combinatorial concept known as a .. Sufficient conditions for these inequalities to be facet-defining, based on the concept of a ., are also provided. Moreover, we answer positively a c作者: CYN 時(shí)間: 2025-3-30 05:20 作者: ABASH 時(shí)間: 2025-3-30 09:14
Compressible (Low-Mach) Two-Phase Flows, . of available contiguous frequency slots, and a multiset of traffic demands ., the C-RSA consists in assigning for each traffic demand . a path in . between its origin and destination, and an interval of contiguous frequency slots in . while satisfying some technological constraints, and minimizin作者: 不給啤 時(shí)間: 2025-3-30 14:26
Valentina Manente,Silvio Caputoystems. Since multiple top-. lists may be generated by different algorithms to evaluate the same set of entities or system of interest, there is often a need to consolidate this collection of heterogeneous top-. lists to obtain a more robust and coherent list. This work introduces various exact math作者: strdulate 時(shí)間: 2025-3-30 17:56
https://doi.org/10.1007/978-3-030-99962-9ry vectors of a given finite length satisfying certain practical constraints, such as a minimum dwell time or a bound on the number of changes over the entire time horizon. While the former constraint has been investigated polyhedrally, no results seem to exist for the latter, although it arises nat作者: CHECK 時(shí)間: 2025-3-30 20:57
Rémi Ardiet,Claude Sobry,Ricardo Melonumber . is the maximum number of 1s no two of which are in a same row, column and a . submatrix of all 1s. In this paper, we continue Lubiw’s study of firm matrices. . is said to be firm if . and this equality holds for all its submatrices. We show that the stronger concept of superfirmness of . is作者: Gourmet 時(shí)間: 2025-3-31 02:21
