標(biāo)題: Titlebook: Combinatorial Optimization -- Eureka, You Shrink!; Papers Dedicated to Michael Jünger,Gerhard Reinelt,Giovanni Rinaldi Book 2003 Springer- [打印本頁(yè)] 作者: retort 時(shí)間: 2025-3-21 16:36
書目名稱Combinatorial Optimization -- Eureka, You Shrink!影響因子(影響力)
書目名稱Combinatorial Optimization -- Eureka, You Shrink!影響因子(影響力)學(xué)科排名
書目名稱Combinatorial Optimization -- Eureka, You Shrink!網(wǎng)絡(luò)公開(kāi)度
書目名稱Combinatorial Optimization -- Eureka, You Shrink!網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Combinatorial Optimization -- Eureka, You Shrink!被引頻次
書目名稱Combinatorial Optimization -- Eureka, You Shrink!被引頻次學(xué)科排名
書目名稱Combinatorial Optimization -- Eureka, You Shrink!年度引用
書目名稱Combinatorial Optimization -- Eureka, You Shrink!年度引用學(xué)科排名
書目名稱Combinatorial Optimization -- Eureka, You Shrink!讀者反饋
書目名稱Combinatorial Optimization -- Eureka, You Shrink!讀者反饋學(xué)科排名
作者: Diverticulitis 時(shí)間: 2025-3-22 00:05 作者: 反饋 時(shí)間: 2025-3-22 01:20 作者: ARCHE 時(shí)間: 2025-3-22 07:35 作者: 埋葬 時(shí)間: 2025-3-22 11:03 作者: 拱形面包 時(shí)間: 2025-3-22 16:03 作者: 拱形面包 時(shí)間: 2025-3-22 18:42 作者: 訓(xùn)誡 時(shí)間: 2025-3-22 23:32 作者: Juvenile 時(shí)間: 2025-3-23 04:29
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programminger programs to optimality. This is especially true for . and . problems. However, other approaches to integer programming are possible. One alternative is provided by so-called . algorithms, in which a feasible integer solution is iteratively improved (augmented) until no further improvement is poss作者: inventory 時(shí)間: 2025-3-23 06:09 作者: 鼓掌 時(shí)間: 2025-3-23 12:50 作者: 緊張過(guò)度 時(shí)間: 2025-3-23 17:17
A Simplex-Based Algorithm for 0-1 Mixed Integer Programmingnd a Gomory-type algorithm that generates violated facet-defining inequalities of a relaxation of the simplex tableau and uses them as cuts for the original problem. We show that the cuts can be computed in polynomial time and can be embedded in a finitely convergent algorithm.作者: aquatic 時(shí)間: 2025-3-23 20:32
Exact Algorithms for NP-Hard Problems: A Surveyd we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.作者: figure 時(shí)間: 2025-3-24 00:23 作者: 手勢(shì) 時(shí)間: 2025-3-24 05:21
https://doi.org/10.1007/978-981-13-9683-0 can be easily adapted for the classical “TSP with Pickup-and- Delivery” (PDTSP). To our knowledge, this is the first work on an exact method to solve the classical PDTSP. Preliminary computational experiments on a test-bed PDTSP instance from the literature show the good performances of our proposal.作者: impaction 時(shí)間: 2025-3-24 08:31
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem can be easily adapted for the classical “TSP with Pickup-and- Delivery” (PDTSP). To our knowledge, this is the first work on an exact method to solve the classical PDTSP. Preliminary computational experiments on a test-bed PDTSP instance from the literature show the good performances of our proposal.作者: arboretum 時(shí)間: 2025-3-24 12:36
On Ensuring Correctness of Cold Schedulerconsecutive ones polytope only grows polynomially if the number of columns is fixed. This gives another proof of the fact that the consecutive ones problem is solvable in polynomial time in this case.作者: 使習(xí)慣于 時(shí)間: 2025-3-24 16:54
https://doi.org/10.1007/978-981-13-6295-8asible solutions. The first digraph gives rise to an algorithmic characterization of bipartite b-matching. The second digraph leads to a polynomial-time augmentation algorithm for the (weighted) matroid intersection problem and to a conjecture about an algorithmic characterization of matroid intersection.作者: Altitude 時(shí)間: 2025-3-24 21:33
Atilla El?i,Pankaj Kumar Sa,Sambit Bakshi the facets of the dual polytope of .). Thereby, we derive polynomial certificates for both the vertex-facet incidences as well as for the abstract objective functions in terms of the graph of .. The paper is a variation on joint work with Michael Joswig and Friederike K?rner [.].作者: 缺乏 時(shí)間: 2025-3-25 02:36 作者: 摸索 時(shí)間: 2025-3-25 05:16
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersectionasible solutions. The first digraph gives rise to an algorithmic characterization of bipartite b-matching. The second digraph leads to a polynomial-time augmentation algorithm for the (weighted) matroid intersection problem and to a conjecture about an algorithmic characterization of matroid intersection.作者: 外露 時(shí)間: 2025-3-25 07:50
Reconstructing a Simple Polytope from Its Graph the facets of the dual polytope of .). Thereby, we derive polynomial certificates for both the vertex-facet incidences as well as for the abstract objective functions in terms of the graph of .. The paper is a variation on joint work with Michael Joswig and Friederike K?rner [.].作者: 知識(shí)分子 時(shí)間: 2025-3-25 15:16
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programmingn this paper we describe a possible implementation of such a finite ABC algorithm for mixed 0-1 and pure 0-1 programs. The algorithm differs from standard branch-and-cut in several important ways. In particular, the terms ., and . take on new meanings in the primal context.作者: Verify 時(shí)間: 2025-3-25 16:14
E. Fantin Irudaya Raj,M. Balajiand-cut algorithms by Fischetti and Toth [.] and by Applegate, Bixby, Chvátal and Cook [.] are considered and tested on a set of 35 real-world instances including 16 new instances recently presented in [.].作者: 滔滔不絕的人 時(shí)間: 2025-3-25 21:38 作者: 使痛苦 時(shí)間: 2025-3-26 03:19 作者: 填滿 時(shí)間: 2025-3-26 04:37
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytopeperstar inequalities which are until now only known to be valid, are indeed facets defining inequalities of STSP and this also generalizes ladder inequalities to a larger class. Finally, we describe some new facet defining inequalities obtained by applying the procedure.作者: Encephalitis 時(shí)間: 2025-3-26 09:21 作者: FLIP 時(shí)間: 2025-3-26 16:14 作者: entrance 時(shí)間: 2025-3-26 18:33 作者: 痛苦一生 時(shí)間: 2025-3-26 22:30
Sanjeev Kumar Sharma,Misha Mittal in connection with their study of the famous Hadwiger Conjecture. In this paper, I prove that the connected matching problem is NP-complete for 0-1-weighted bipartite graphs, but polytime-solvable for chordal graphs and for graphs with no circuits of size 4.作者: 放逐 時(shí)間: 2025-3-27 01:24 作者: 隱士 時(shí)間: 2025-3-27 08:22
https://doi.org/10.1007/978-981-13-6295-8plied to the combinatorial optimization problem under investigation. According to Jack Edmonds, the Greedy algorithm leads to an algorithmic characterization of matroids. We deal here with the algorithmic characterization of the intersection of two matroids. To this end we introduce two different au作者: GUMP 時(shí)間: 2025-3-27 10:00
E. Fantin Irudaya Raj,M. Balaji The results of this comparison proved that branch-and-cut is the most effective method to solve hard ATSP instances. In the present paper the branch-and-cut algorithms by Fischetti and Toth [.] and by Applegate, Bixby, Chvátal and Cook [.] are considered and tested on a set of 35 real-world instanc作者: 聽(tīng)覺(jué) 時(shí)間: 2025-3-27 17:38
E. Fantin Irudaya Raj,M. Balajive it with the bundle method. The cutting plane model at each iteration which approximates the original problem can be kept moderately small and we can solve it very quickly. We report successful numerical results for approximating maximum cut.作者: modish 時(shí)間: 2025-3-27 21:32
https://doi.org/10.1007/978-981-13-9683-0r requiring known amounts of a product, and the vehicle has a given capacity and is located in a special city called depot. Each customer and the depot must be visited exactly once by the vehicle serving the demands while minimizing the total travel distance. It is assumed that the product collected作者: 思考 時(shí)間: 2025-3-27 22:41
Atilla El?i,Pankaj Kumar Sa,Sambit Bakshiact graph. Their proof is not constructive. Kalai [.] found a short, elegant, and algorithmic proof of that result. However, his algorithm has always exponential running time. We show that the problem to reconstruct the vertex-facet incidences of a simple polytope . from its graph can be formulated 作者: 牽連 時(shí)間: 2025-3-28 03:34
Subhajit Das,Arun Kumar Sunaniyaer programs to optimality. This is especially true for . and . problems. However, other approaches to integer programming are possible. One alternative is provided by so-called . algorithms, in which a feasible integer solution is iteratively improved (augmented) until no further improvement is poss作者: 甜得發(fā)膩 時(shí)間: 2025-3-28 07:17
Atilla El?i,Pankaj Kumar Sa,Sambit Bakshialities, we obtain completely or partially known classes of inequalities like . inequalities for STSP. This provides a proof that a large subset of hyperstar inequalities which are until now only known to be valid, are indeed facets defining inequalities of STSP and this also generalizes ladder ineq作者: 陪審團(tuán)每個(gè)人 時(shí)間: 2025-3-28 11:59
On Ensuring Correctness of Cold Schedulerl prove some results about the facet structure of the betweenness polytope and show how facets of this polytope can be used to generate facets of the consecutive ones polytope. Furthermore, the relations with the consecutive ones polytopes will enable us to conclude that the number of facets of the 作者: inquisitive 時(shí)間: 2025-3-28 16:16 作者: 字謎游戲 時(shí)間: 2025-3-28 22:27 作者: 命令變成大炮 時(shí)間: 2025-3-29 01:06 作者: 侵略 時(shí)間: 2025-3-29 05:01 作者: 有花 時(shí)間: 2025-3-29 08:48 作者: 使聲音降低 時(shí)間: 2025-3-29 15:27 作者: 粗魯性質(zhì) 時(shí)間: 2025-3-29 16:49 作者: FILLY 時(shí)間: 2025-3-29 20:30 作者: 反話 時(shí)間: 2025-3-30 00:01
“Eureka — You Shrink!”In the evening of March 7, 2001, there was a surprise session for Jack Edmonds entitled “Eureka — You Shrink!”.作者: indemnify 時(shí)間: 2025-3-30 07:15 作者: Perceive 時(shí)間: 2025-3-30 12:01 作者: 犬儒主義者 時(shí)間: 2025-3-30 14:02
Mixed-Integer Value Functions in Stochastic ProgrammingWe discuss the role of mixed-integer value functions in the theoretical analysis of stochastic integer programs. It is shown how the interaction of value function properties with basic results from probability theory leads to structural statements in stochastic integer programming.作者: 是突襲 時(shí)間: 2025-3-30 19:07
Combinatorial Optimization -- Eureka, You Shrink!978-3-540-36478-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 嚴(yán)厲批評(píng) 時(shí)間: 2025-3-30 22:33
0302-9743 Overview: Includes supplementary material: 978-3-540-00580-3978-3-540-36478-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 有角 時(shí)間: 2025-3-31 00:51
Yu Bin,Zhang Yi,Ye Chao,Xing Binence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts is that all bases have the same cardinality. (See Van der Waerden, Section 33.)
