作者: NADIR 時(shí)間: 2025-3-21 21:34 作者: 吸氣 時(shí)間: 2025-3-22 04:19
The New Faces of Combinatorial Optimizationrch tradition: Multicriterion optimization, competitive equilibria, and optimizing with incentives. I also discuss the surprisingly weak connections between optimization and evolution (this latter topic was the subject of my ISCO talk).作者: PUT 時(shí)間: 2025-3-22 07:28
Models and Algorithms for the Train Unit Assignment Problempplication of mathematical models and optimization techniques, which generally lead to an improvement in the performance of the system, and also to a reduction in the time required for solving these problems. The planning process is generally divided into several phases: Line Planning, Train Timetab作者: Heretical 時(shí)間: 2025-3-22 10:18 作者: 小畫像 時(shí)間: 2025-3-22 13:49
Orbital Shrinkingducing artificial symmetry-breaking conditions into the problem, and/or by using an ad-hoc search strategy. In this paper we argue that symmetry is instead a beneficial feature that we should preserve and exploit as much as possible, breaking it only as a last resort. To this end, we outline a new a作者: 小畫像 時(shí)間: 2025-3-22 19:31 作者: Monocle 時(shí)間: 2025-3-22 23:20
A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programsmed to be normally distributed. The problem can be approximated by another stochastic program, whose optimal value is an upper bound of the original problem. The latter stochastic program can be approximated by two second-order cone programming (SOCP) problems [5]. Furthermore, in some cases, the op作者: Oscillate 時(shí)間: 2025-3-23 04:34 作者: 苦笑 時(shí)間: 2025-3-23 07:10
The Non-Disjoint ,-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Designof a ring. We first show that there is no two-index integer formulation for this problem. We then present a mathematical model for the NDRSP along with some classes of valid inequalities that are used as cutting planes in a Branch-and-Cut approach. We also study the dominant polytope of the NDRSP an作者: 擴(kuò)張 時(shí)間: 2025-3-23 09:59 作者: 有毛就脫毛 時(shí)間: 2025-3-23 16:59 作者: Aspiration 時(shí)間: 2025-3-23 20:05
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocolsomized communication protocol computing the matrix in expectation. We use this connection to prove new conditional lower bounds on the sizes of extended formulations, in particular, for perfect matching polytopes.作者: Substance-Abuse 時(shí)間: 2025-3-24 01:42 作者: 本能 時(shí)間: 2025-3-24 05:19
Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopesrepresented by a certain system of linear inequalities if and only if the systems of linear inequalities associated with the cardinalities are dual consistent. Typical dual consistent systems of inequalities are those which describe polymatroids, generalized polymatroids, and dual greedy polyhedra w作者: 為敵 時(shí)間: 2025-3-24 09:48
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Conecovers a column . if ..?>?0. In order to measure how proportional a cover is, we introduce two different minimization problems, namely the . (MGRC) and the . (MLRC) problems. In both cases, we apply the notion of the . of a vector ., which is given by .. We show that these two problems are NP-hard, 作者: laceration 時(shí)間: 2025-3-24 12:17 作者: 掃興 時(shí)間: 2025-3-24 15:46
Fast Separation Algorithms for Three-Index Assignment Problemss. To incorporate such families of inequalities within a ‘Branch & Cut’ algorithm requires one further step: that of deriving an algorithm which determines whether an inequality of a specific family is violated by a given vector (the separation problem). The idea put forward in this work is to consi作者: 攀登 時(shí)間: 2025-3-24 20:12
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes an edge-weighted undirected graph whose nodes are partitioned into a set of root nodes, a set of terminals and a set of potential Steiner nodes, find a minimum-weight subtree that spans all the roots and terminals so that the number of hops between each . and an arbitrary root does not exceed a giv作者: 洞察力 時(shí)間: 2025-3-25 00:20
0302-9743 proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original r作者: MILL 時(shí)間: 2025-3-25 05:14 作者: Ptsd429 時(shí)間: 2025-3-25 10:45
Steven P. Neeck,Theodore F. Hammern particular, we describe heuristic separation algorithms for gap inequalities and their special cases, and show that an LP-based cutting-plane algorithm based on these separation heuristics can yield very good upper bounds in practice.作者: 外向者 時(shí)間: 2025-3-25 13:53 作者: 知道 時(shí)間: 2025-3-25 16:17 作者: Clinch 時(shí)間: 2025-3-25 21:53
1.13 Errata and Addenda for Vol. 22a, measures can be classified on the basis of the structure of the optimum hyperpath they determine, we present an alternative taxonomy of measure functions, based on their analytic properties, and prove structure theorems that relate the two hierarchies.作者: Popcorn 時(shí)間: 2025-3-26 01:06
1.13 Errata and Addenda for Vol. 22a,h two instance classes comparing the performance of the latter algorithm against that of a standard (exact) .&.. The results reveal that the Lagrangian algorithm yielded solutions with minute, and often null, duality gaps for instances with several hundreds of points in small computation times.作者: 沒有準(zhǔn)備 時(shí)間: 2025-3-26 08:20
1.13 Errata and Addenda for Vol. 22a,d to “encapsulate” model symmetry. This leads to a discrete relaxation of the original problem, whose solution yields a bound on its optimal value. Encouraging preliminary computational experiments on the tightness and solution speed of this relaxation are presented.作者: VEN 時(shí)間: 2025-3-26 10:43
1.12 Programs for computational chemistry,hat the semidefinite relaxation improves significantly the continuous relaxation (112% on average) and that it often provides a lower bound very close to the optimal value. In addition, the computational time for obtaining these results remains reasonable.作者: PANG 時(shí)間: 2025-3-26 14:31 作者: blight 時(shí)間: 2025-3-26 17:11 作者: Lipoprotein 時(shí)間: 2025-3-26 23:08 作者: TOM 時(shí)間: 2025-3-27 01:25
Orbital Shrinkingd to “encapsulate” model symmetry. This leads to a discrete relaxation of the original problem, whose solution yields a bound on its optimal value. Encouraging preliminary computational experiments on the tightness and solution speed of this relaxation are presented.作者: Coma704 時(shí)間: 2025-3-27 06:24
Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Programhat the semidefinite relaxation improves significantly the continuous relaxation (112% on average) and that it often provides a lower bound very close to the optimal value. In addition, the computational time for obtaining these results remains reasonable.作者: macabre 時(shí)間: 2025-3-27 12:55
Fast Separation Algorithms for Three-Index Assignment Problemsustrate the idea on the separation of known inequalities for the three index assignment polytope. It turns out that we find new separation algorithms with better complexities than the current ones (that were called best possible).作者: cluster 時(shí)間: 2025-3-27 16:39 作者: MORT 時(shí)間: 2025-3-27 19:42 作者: GLIB 時(shí)間: 2025-3-27 23:18 作者: 就職 時(shí)間: 2025-3-28 02:13 作者: 偏離 時(shí)間: 2025-3-28 07:40 作者: 閃光東本 時(shí)間: 2025-3-28 12:59
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Coneeven in the case in which |.|?=?1. We introduce a mixed integer programming formulation for the MGRC problem, which is solvable in polynomial time if all columns should be covered, and introduce a branch-and-cut algorithm for the MLRC problem. Finally, we present computational experiments on data obtained from real metabolic networks. .作者: antenna 時(shí)間: 2025-3-28 15:24 作者: 詳細(xì)目錄 時(shí)間: 2025-3-28 21:00 作者: FLASK 時(shí)間: 2025-3-28 23:42 作者: Acetaldehyde 時(shí)間: 2025-3-29 06:39 作者: 災(zāi)禍 時(shí)間: 2025-3-29 07:45
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodeso improve the quality of lower bounds of both models. To solve the problem to optimality, we implement branch-and-price algorithms for all proposed formulations. Our computational results show that the branch-and-price approaches based on path formulations outperform the flow formulations if the hop limit is not too loose.作者: Resistance 時(shí)間: 2025-3-29 15:13
Conference proceedings 2012m 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundations and theory of algorithms to computational studies and practical applications.作者: 侵害 時(shí)間: 2025-3-29 19:32
1.12 Programs for computational chemistry,. We demonstrate this by computing the bound associated with the level 1, 2, and 3 relaxations of several highly symmetric binary integer programming problems. We also present a class of constraints, called ., that further improves the bound, and in some cases provides a tight formulation.作者: NIP 時(shí)間: 2025-3-29 22:57 作者: CANDY 時(shí)間: 2025-3-30 02:48 作者: 木質(zhì) 時(shí)間: 2025-3-30 07:04
https://doi.org/10.1007/978-3-642-03501-2d characterize when these inequalities define facets for the associated polytope. Moreover, we devise separation routines for these inequalities. Based on this, we develop a Branch-and-Cut algorithm and present some experimental results.作者: 離開 時(shí)間: 2025-3-30 10:48 作者: AUGER 時(shí)間: 2025-3-30 14:27
Jeng-Shing Chern,Arthur Huang,Lance Wueven in the case in which |.|?=?1. We introduce a mixed integer programming formulation for the MGRC problem, which is solvable in polynomial time if all columns should be covered, and introduce a branch-and-cut algorithm for the MLRC problem. Finally, we present computational experiments on data obtained from real metabolic networks. .作者: 曲解 時(shí)間: 2025-3-30 17:02
Conference proceedings 201212, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundati作者: 高興一回 時(shí)間: 2025-3-30 21:36 作者: 裂縫 時(shí)間: 2025-3-31 03:53 作者: 未成熟 時(shí)間: 2025-3-31 06:14
1.13 Errata and Addenda for Vol. 22a,rch tradition: Multicriterion optimization, competitive equilibria, and optimizing with incentives. I also discuss the surprisingly weak connections between optimization and evolution (this latter topic was the subject of my ISCO talk).作者: Etymology 時(shí)間: 2025-3-31 10:21
Tippawan Wanwiwake,Craig Underwoodomized communication protocol computing the matrix in expectation. We use this connection to prove new conditional lower bounds on the sizes of extended formulations, in particular, for perfect matching polytopes.作者: Control-Group 時(shí)間: 2025-3-31 13:43
A. Ridha Mahjoub,Vangelis Markakis,Vangelis Th. PaUp to date results.State of the art research.Fast track conference proceedings作者: construct 時(shí)間: 2025-3-31 20:43
