標題: Titlebook: Combinatorial Optimization; 4th International Sy Raffaele Cerulli,Satoru Fujishige,A. Ridha Mahjoub Conference proceedings 2016 Springer In [打印本頁] 作者: 怕跛行他有限 時間: 2025-3-21 19:23
書目名稱Combinatorial Optimization影響因子(影響力)
書目名稱Combinatorial Optimization影響因子(影響力)學科排名
書目名稱Combinatorial Optimization網絡公開度
書目名稱Combinatorial Optimization網絡公開度學科排名
書目名稱Combinatorial Optimization被引頻次
書目名稱Combinatorial Optimization被引頻次學科排名
書目名稱Combinatorial Optimization年度引用
書目名稱Combinatorial Optimization年度引用學科排名
書目名稱Combinatorial Optimization讀者反饋
書目名稱Combinatorial Optimization讀者反饋學科排名
作者: Hemiparesis 時間: 2025-3-21 22:23 作者: MURKY 時間: 2025-3-22 01:39 作者: 撫育 時間: 2025-3-22 04:48
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229955.jpg作者: growth-factor 時間: 2025-3-22 11:54 作者: 臭了生氣 時間: 2025-3-22 13:47
978-3-319-45586-0Springer International Publishing Switzerland 2016作者: 臭了生氣 時間: 2025-3-22 18:18 作者: Moderate 時間: 2025-3-22 22:00 作者: Wallow 時間: 2025-3-23 04:34
https://doi.org/10.1007/3-540-16662-9 demand is affected by uncertainty. This setting is particularly relevant in the energy sector, where the demands must be satisfied in a timely manner and storage losses are, often, unavoidable. We propose a two-stage robust optimization approach to tackle the problem with second stage storage varia作者: 驚呼 時間: 2025-3-23 06:04 作者: Antagonist 時間: 2025-3-23 13:45
Small Ring Compounds in Organic Synthesis IVce) which visits every vertex odd number of times. Nishiyama et al. (2015) investigated the . version of the PHC problem, and gave a simple characterization that a connected undirected graph has a PHC if and only if it has even order or it is non-bipartite. This paper gives a complete characterizati作者: Postmenopause 時間: 2025-3-23 15:12 作者: Override 時間: 2025-3-23 20:05
Nobuharu Iwasawa,Koichi Narasakasponsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. To the best of our knowledge, no exact algorithms have been proposed for this problem. We therefore introduce three integ作者: humectant 時間: 2025-3-24 00:28
Small Ring Compounds in Organic Synthesis VItegy space of every player is a ., then equilibria are unique. Bidirectional flow polymatroids are introduced as a subclass of polymatroids possessing certain exchange properties. We show that important cases such as base orderable matroids can be recovered as a special case of bidirectional flow po作者: grandiose 時間: 2025-3-24 03:01 作者: Morsel 時間: 2025-3-24 08:26 作者: 委屈 時間: 2025-3-24 10:56
1.13 Errata and Addenda for Vol. 22a,ver, most models directly include the signal-to-interference ratios representing service coverage conditions. This leads to mixed-integer linear programs with constraint matrices containing tiny coefficients that vary widely in their order of magnitude. These formulations are known to be challenging作者: hemorrhage 時間: 2025-3-24 16:19 作者: 熱心助人 時間: 2025-3-24 21:42 作者: 高原 時間: 2025-3-25 00:45 作者: RODE 時間: 2025-3-25 05:15
1.13 Errata and Addenda for Vol. 22a,lexity, and statistics..We investigate upper bounds on the product of the number of facets . and the number of vertices ., where . is the dimension of a 2-level polytope .. This question was first posed in [.], where experimental results showed . up?to ...We show that this bound holds for all known 作者: ALERT 時間: 2025-3-25 07:50
1.13 Errata and Addenda for Vol. 22a,t, determine a basis of minimum cost among those with . red elements, or decide that no such basis exists. In this paper, we investigate possible extensions of this result from ordinary matroids to the more general notion of .. Poset matroids (also called .) are defined on the collection of all idea作者: Insensate 時間: 2025-3-25 14:34 作者: 憎惡 時間: 2025-3-25 17:14 作者: dialect 時間: 2025-3-25 21:33
Combinatorial Optimization978-3-319-45587-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 四指套 時間: 2025-3-26 03:01 作者: glucagon 時間: 2025-3-26 05:21
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions,ict the input graph?. to some special graph class. We continue a line of research that considers these problems for subclasses of perfect graphs, but our main results are full classifications, from a computational complexity point of view, for graph classes characterized by forbidding a single induced connected subgraph?..作者: ABYSS 時間: 2025-3-26 10:11
The Parity Hamiltonian Cycle Problem in Directed Graphs,on when a directed graph has a PHC, and shows that the PHC problem in a directed graph is solved in polynomial time. The characterization, unlike with the undirected case, is described by a linear system over GF(2).作者: MAIM 時間: 2025-3-26 14:06 作者: 容易生皺紋 時間: 2025-3-26 20:28 作者: Crayon 時間: 2025-3-26 21:59
https://doi.org/10.1007/3-540-16662-9an application of robust lot sizing arising in the context of heat and power cogeneration and show that, even in this case, we can solve the problem as an instance of the deterministic lot sizing problem. Computational experiments are reported and illustrated.作者: 未成熟 時間: 2025-3-27 05:01
Nobuharu Iwasawa,Koichi Narasakay requirements and two compact formulations based on network flows. For the former we implement a branch-and-cut algorithm which separates connectivity constraints. We built a test instance generator, partially based on publicly-available real world data, in order to compare empirically the three formulations.作者: Dysplasia 時間: 2025-3-27 07:55
Small Ring Compounds in Organic Synthesis VIplittable congestion game with at least three players and non-matroidal set systems per player, there is an isomorphic game having multiple equilibria. Our results leave a gap between base orderable matroids and general matroids for which we do not know whether equilibria are unique.作者: Circumscribe 時間: 2025-3-27 12:36 作者: 緯線 時間: 2025-3-27 14:47
1.13 Errata and Addenda for Vol. 22a, polynomially solvable. In this work, we first prove that .PF is NP-complete for bipartite graphs, as .LP is known to be. We also obtain new graph classes where the complexity of these problems would coincide.作者: 偽造 時間: 2025-3-27 18:59
1.13 Errata and Addenda for Vol. 22a,base polytopes of matroids. For the latter family, we also give a simple description of the facet-defining inequalities. These results are achieved by an investigation of related combinatorial objects, that could be of independent interest.作者: 宣傳 時間: 2025-3-27 23:47 作者: 鉗子 時間: 2025-3-28 03:45
On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogenan application of robust lot sizing arising in the context of heat and power cogeneration and show that, even in this case, we can solve the problem as an instance of the deterministic lot sizing problem. Computational experiments are reported and illustrated.作者: Pageant 時間: 2025-3-28 09:33 作者: 內部 時間: 2025-3-28 10:43 作者: 笨重 時間: 2025-3-28 14:42 作者: 廚師 時間: 2025-3-28 20:43
Towards a Polynomial Equivalence Between ,-Packing Functions and ,-Limited Packings in Graphs, polynomially solvable. In this work, we first prove that .PF is NP-complete for bipartite graphs, as .LP is known to be. We also obtain new graph classes where the complexity of these problems would coincide.作者: Talkative 時間: 2025-3-29 00:02 作者: octogenarian 時間: 2025-3-29 03:55
Optimization Problems with Color-Induced Budget Constraints,t consists of binary trees of height two. On the positive side, we present two polynomial algorithms: one for integer polymatroids, i.e., the case where the poset consists of disjoint chains, and one for the problem to determine a minimum cost ideal of size . with . red elements, i.e., the uniform rank-. poset matroid, on series-parallel posets.作者: Bone-Scan 時間: 2025-3-29 10:43
Conference proceedings 2016ons. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; and graphs and combinatorics..作者: CON 時間: 2025-3-29 13:46
0302-9743 ully reviewed and selected from 98 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; and graphs and combinatorics..978-3-319-45586-0978-3-319-45587-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 落葉劑 時間: 2025-3-29 15:42
Paul Binger,Holger Michael Büchduling, graph orientation, maximum clique, etc. We also show that the underlying separation problems are solvable in polynomial time and thus optimization over those polytopes can be done in polynomial time.作者: 考博 時間: 2025-3-29 23:04
-Dihalocyclopropanes in organic synthesis,ict the input graph?. to some special graph class. We continue a line of research that considers these problems for subclasses of perfect graphs, but our main results are full classifications, from a computational complexity point of view, for graph classes characterized by forbidding a single induced connected subgraph?..作者: entrance 時間: 2025-3-30 00:41 作者: magnanimity 時間: 2025-3-30 07:18 作者: anesthesia 時間: 2025-3-30 12:11 作者: 圖表證明 時間: 2025-3-30 13:47 作者: Gleason-score 時間: 2025-3-30 16:55
1.13 Errata and Addenda for Vol. 22a,oximate . for any fixed . and .. This result is tight as any solution is a .-approximation. We also prove without assuming UGC that . is .-complete even for ., and we provide an example of .-approximation algorithm for .. Finally, we show that . is polynomial-time solvable for fixed . (which cannot be extended to . according to?[.]).作者: flaunt 時間: 2025-3-30 22:07 作者: 外貌 時間: 2025-3-31 02:41
0302-9743 um on Combinatorial Optimization, ISCO 2016, held in Vietri sul Mare, Italy, in May 2016. The 38 revised full papers presented in this book were carefully reviewed and selected from 98 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and co作者: 形上升才刺激 時間: 2025-3-31 05:11
https://doi.org/10.1007/3-540-60495-2, and to find a polyhedral relaxation of . that coincides with . and . if and only if . is .-perfect. An according conjecture has been recently formulated (.-Perfect Graph Conjecture); here we verify it for the well-studied class of claw-free graphs.作者: fibroblast 時間: 2025-3-31 12:47
1.13 Errata and Addenda for Vol. 22a,osed. We theoretically and computationally compare these different formulations, testing them on real-world and randomly generated instances. Our study is the first step for efficiently tackling and solving this challenging real-world lot-sizing problem.作者: 或者發(fā)神韻 時間: 2025-3-31 13:49
1.13 Errata and Addenda for Vol. 22a,ration based heuristic optimisation procedures. The procedures are compared by means of computational experiments that use data originating from a large Australian electricity distributor with several thousand employees.作者: fender 時間: 2025-3-31 17:33 作者: 提煉 時間: 2025-3-31 22:47 作者: Migratory 時間: 2025-4-1 01:51 作者: 愛社交 時間: 2025-4-1 07:26
,On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regrmax regret problem. In this work, we formally describe these algorithms through the definition of a logic-based Benders’ decomposition framework and prove their convergence to an optimal solution in a finite number of iterations. As this framework is applicable to any interval 0–1 min-max regret pro作者: 出沒 時間: 2025-4-1 10:57 作者: cochlea 時間: 2025-4-1 15:25 作者: NICHE 時間: 2025-4-1 21:01 作者: reject 時間: 2025-4-2 00:23
