作者: Tremor 時間: 2025-3-21 20:59 作者: 定點 時間: 2025-3-22 02:25
On the symmetric travelling salesman problem: Solution of a 120-city problem,trate how the knowledge of the facets of this polytope can be utilized to solve large-scale travelling salesman problems. In particular, we report how the shortest roundtrip through 120 German cities was found using a commercial linear programming code and adding facetial cutting planes in an interactive way.作者: ARY 時間: 2025-3-22 04:46 作者: Debility 時間: 2025-3-22 09:22
Quadratic knapsack problems,for the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed. Some theoretical results concerning the class of all upper planes, as well as extensive computational experience, are reported.作者: GNAT 時間: 2025-3-22 14:26
Combinatorial Optimization I978-3-642-00802-3Series ISSN 0303-3929 Series E-ISSN 2364-8201 作者: GNAT 時間: 2025-3-22 19:38
0303-3929 Overview: 978-3-642-00802-3Series ISSN 0303-3929 Series E-ISSN 2364-8201 作者: 大猩猩 時間: 2025-3-23 00:26 作者: CRUMB 時間: 2025-3-23 04:08 作者: Accessible 時間: 2025-3-23 07:38
Lecture Notes in Production Engineeringfor the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed. Some theoretical results concerning the class of all upper planes, as well as extensive computational experience, are reported.作者: grounded 時間: 2025-3-23 12:58
Mathematical Programming Studieshttp://image.papertrans.cn/c/image/229952.jpg作者: ASTER 時間: 2025-3-23 15:56 作者: 勉勵 時間: 2025-3-23 21:49
Stefano Moncada,Lino Briguglio,Leonard Nurseertain inequalities, also called conditional. If such a conditional lower bound exceeds some known upper bound, then every solution better than the one corresponding to the upper bound violates at least one of the conditional inequalities. This yields a valid disjunction, which can be used to partit作者: disciplined 時間: 2025-3-23 23:06
Marc Dumas-Johansen,Andreas Thulstrupconditional bounds discussed in the companion paper [2]. The algorithm uses a set of heuristics to find prime covers, another set of heuristics to find feasible solutions to the dual linear program which are needed to generate cuts, and subgradient optimization to find lower bounds. It also uses imp作者: BLANK 時間: 2025-3-24 06:17
Marc Dumas-Johansen,Andreas Thulstruptrate how the knowledge of the facets of this polytope can be utilized to solve large-scale travelling salesman problems. In particular, we report how the shortest roundtrip through 120 German cities was found using a commercial linear programming code and adding facetial cutting planes in an intera作者: 昏暗 時間: 2025-3-24 09:14 作者: LATHE 時間: 2025-3-24 12:34
https://doi.org/10.1007/978-3-031-05732-8re efficient than those using the assignment relaxation due to the sharper bounds obtained. Held and Karp noted an analogous relationship between the asymmetric travelling salesman problem and the minimum one-arborescence problem. We implemented a LIFO implicit enumeration algorithm based on this id作者: Ejaculate 時間: 2025-3-24 17:47
Jens Peter Wulfsberg,Adam Sandersems which were given by the authors independently in earlier papers ([3] and [6]). Besides a unified formulation of the earlier results some modifications and extensions are presented here underlining the central role which the greedy algorithm plays in combinatorial optimization.作者: 對待 時間: 2025-3-24 19:30
Lecture Notes in Production Engineeringfor the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed. Some theoretical results concerning the class of all upper planes, as well as extensive computational experience, are reported.作者: 疼死我了 時間: 2025-3-25 00:30 作者: 載貨清單 時間: 2025-3-25 04:56 作者: 煩躁的女人 時間: 2025-3-25 07:44 作者: 動作謎 時間: 2025-3-25 11:53
Small Machine Tools for Small WorkpiecesA polynomial bounded method is presented for computing bounds to the value of the optimum of a large class of NP-hard combinatorial optimization problems.作者: BLINK 時間: 2025-3-25 18:01
Introduction to the Nuclear Power Industry,We investigate the problem of when a .-matching problem with integer edge costs has an integer optimal dual solution. We introduce the concept of .-bicritical graphs, give a characterization of them and show that these play a pivotal role in determining when there exists an integer optimal dual solution.作者: 弓箭 時間: 2025-3-25 22:19
https://doi.org/10.1007/978-3-319-92594-3A general method is described for determining blocking and anti-blocking polyhedra related to any combinatorial family given as the extreme points of a polyhedron. This technique is illustrated in detail for the common independent sets of two matroids.作者: 清楚 時間: 2025-3-26 04:10 作者: aggravate 時間: 2025-3-26 04:26
Dual integrality in ,-matching problems,We investigate the problem of when a .-matching problem with integer edge costs has an integer optimal dual solution. We introduce the concept of .-bicritical graphs, give a characterization of them and show that these play a pivotal role in determining when there exists an integer optimal dual solution.作者: Admonish 時間: 2025-3-26 12:32 作者: 多嘴多舌 時間: 2025-3-26 15:51 作者: CAND 時間: 2025-3-26 18:56
Marc Dumas-Johansen,Andreas Thulstrupthat emerged as best was run on 55 randomly generated test problems (20 of them from the literature), with up to 200 constraints and 2000 variables. The results show the algorithm to be more reliable and efficient than earlier procedures on large, sparse set covering problems.作者: 桉樹 時間: 2025-3-26 21:37 作者: GEN 時間: 2025-3-27 04:25
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computatithat emerged as best was run on 55 randomly generated test problems (20 of them from the literature), with up to 200 constraints and 2000 variables. The results show the algorithm to be more reliable and efficient than earlier procedures on large, sparse set covering problems.作者: 曲解 時間: 2025-3-27 08:38
https://doi.org/10.1007/978-3-031-05732-8ea and found that it is inferior to the assignment relaxation for two reasons: the relatively large computation time required to compute a minimum one-arborescence; and, more importantly, the fact that the bounds obtained from the two relaxations are about the same for asymmetric problems.作者: 恭維 時間: 2025-3-27 10:27 作者: 偶像 時間: 2025-3-27 14:04
Energy Hubs: Models and Options,r tour. The empirical results based on a total of 74 problems of sizes ranging from 15-cities to 318-cities lend convincing support to the hypothesis that inequalities defining facets of the convex hull of tours are of substantial computational value in the solution of this difficult combinatorial problem.作者: 坦白 時間: 2025-3-27 19:27
Kenny Pagel,Welf-Guntram Drosselteger polytope. Also some families of SPLP with large duality gaps will be described, together with facets which bridge these gaps. Much of the motivation stems from algorithmic work in which the exploitation of “good” cutting planes within a direct dual algorithm have been shown to be of crucial importance.作者: expansive 時間: 2025-3-27 23:53 作者: 克制 時間: 2025-3-28 04:23 作者: 庇護 時間: 2025-3-28 08:57
On the symmetric travelling salesman problem: A computational study,r tour. The empirical results based on a total of 74 problems of sizes ranging from 15-cities to 318-cities lend convincing support to the hypothesis that inequalities defining facets of the convex hull of tours are of substantial computational value in the solution of this difficult combinatorial problem.作者: 鄙視讀作 時間: 2025-3-28 13:50
Fractional vertices, cuts and facets of the simple plant location problem,teger polytope. Also some families of SPLP with large duality gaps will be described, together with facets which bridge these gaps. Much of the motivation stems from algorithmic work in which the exploitation of “good” cutting planes within a direct dual algorithm have been shown to be of crucial importance.作者: 世俗 時間: 2025-3-28 18:09
Balanced matrices and property (,),ach column. In this paper, we prove more “minimax” equalities for balanced hypergraphs, than those already proved in Berge [1], Berge and Las Vergnas [3], Fulkerson et al. [7], Lovász [12]; in fact, the known results will follow easily from our main theorem.作者: 我不死扛 時間: 2025-3-28 20:41 作者: Hiatus 時間: 2025-3-28 23:51
Cutting planes from conditional bounds: A new approach to set covering,f positive coefficients. We discuss the properties of the family of cuts from conditional bounds, and give a procedure for generating strong members of the family. Finally, we outline a class of algorithms based on these cuts. Our approach was implemented and extensively tested in a computational st作者: pulse-pressure 時間: 2025-3-29 03:56
Stefano Moncada,Lino Briguglio,Leonard Nursef positive coefficients. We discuss the properties of the family of cuts from conditional bounds, and give a procedure for generating strong members of the family. Finally, we outline a class of algorithms based on these cuts. Our approach was implemented and extensively tested in a computational st作者: stress-test 時間: 2025-3-29 08:37 作者: 鎮(zhèn)壓 時間: 2025-3-29 12:14 作者: 子女 時間: 2025-3-29 17:33
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computaticonditional bounds discussed in the companion paper [2]. The algorithm uses a set of heuristics to find prime covers, another set of heuristics to find feasible solutions to the dual linear program which are needed to generate cuts, and subgradient optimization to find lower bounds. It also uses imp作者: Postmenopause 時間: 2025-3-29 23:17
On the symmetric travelling salesman problem: Solution of a 120-city problem,trate how the knowledge of the facets of this polytope can be utilized to solve large-scale travelling salesman problems. In particular, we report how the shortest roundtrip through 120 German cities was found using a commercial linear programming code and adding facetial cutting planes in an intera作者: 高腳酒杯 時間: 2025-3-30 03:25
On the symmetric travelling salesman problem: A computational study,riables. We use this formulation and report the results of a computational study addressing itself to the problem of proving optimality of a particular tour. The empirical results based on a total of 74 problems of sizes ranging from 15-cities to 318-cities lend convincing support to the hypothesis 作者: 換話題 時間: 2025-3-30 07:45 作者: Isometric 時間: 2025-3-30 09:47
Worst case analysis of greedy type algorithms for independence systems,ems which were given by the authors independently in earlier papers ([3] and [6]). Besides a unified formulation of the earlier results some modifications and extensions are presented here underlining the central role which the greedy algorithm plays in combinatorial optimization.作者: NATTY 時間: 2025-3-30 13:14 作者: 諷刺 時間: 2025-3-30 17:03
Fractional vertices, cuts and facets of the simple plant location problem,es of fractional vertices and derive from them valid inequalities for the integer problem. Some of these will actually be shown to be facets of the integer polytope. Also some families of SPLP with large duality gaps will be described, together with facets which bridge these gaps. Much of the motiva作者: 饑荒 時間: 2025-3-30 23:37
