標(biāo)題: Titlebook: Combinatorial Optimization; Third International Pierre Fouilhoux,Luis Eduardo Neves Gouveia,Vangel Conference proceedings 2014 Springer In [打印本頁(yè)] 作者: FAULT 時(shí)間: 2025-3-21 19:33
書目名稱Combinatorial Optimization影響因子(影響力)
作者: 俗艷 時(shí)間: 2025-3-22 00:11 作者: Mirage 時(shí)間: 2025-3-22 02:46
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229961.jpg作者: Mangle 時(shí)間: 2025-3-22 05:15 作者: lesion 時(shí)間: 2025-3-22 10:28
https://doi.org/10.1007/978-3-322-94415-3twork flow problems. We show that the function is piecewise hyperbolic, and modify a parametric optimization technique, the ES algorithm, to find this function. The running time of the algorithm is ., when . is a source-sink edge connectivity of our network, . is the number of links, and . is the nu作者: FELON 時(shí)間: 2025-3-22 14:32 作者: FELON 時(shí)間: 2025-3-22 17:10 作者: omnibus 時(shí)間: 2025-3-22 21:24 作者: 使困惑 時(shí)間: 2025-3-23 01:31
https://doi.org/10.1007/978-3-319-01104-2ery bin a cost function that is convex in the total load on this bin. These costs are subtracted from the profits of assigned items, and the task is to find an assignment maximizing the resulting net profit..We show that even restricted cases of this problem remain strongly NP-complete, and identify作者: 預(yù)定 時(shí)間: 2025-3-23 07:07
Detectors for Small-Animal SPECT I,. subsets . in . whose intersection size . is maximum. The M.SI problem is NP-hard and hard to approximate. Some applications of the M.SI problem can be found in the literature and, to the best of our knowledge, no exact method was proposed to solve this problem. In this work, we introduce a very ef作者: Tidious 時(shí)間: 2025-3-23 13:03 作者: nonplus 時(shí)間: 2025-3-23 16:42 作者: 熄滅 時(shí)間: 2025-3-23 20:34 作者: CONE 時(shí)間: 2025-3-23 23:06
https://doi.org/10.1007/978-3-642-71087-2d from sequencing data, aim to reconstruct the complete genomes by inserting a collection of missing genes. More precisely, in the first problem, called ., we are given an incomplete genome . and a complete genome ., and we look for the insertion of missing genes into . with the goal of maximizing t作者: 有惡意 時(shí)間: 2025-3-24 03:22
N. Rotman,F. Michot,J. M. Hay,P. L. Fagniezin these trees are also node disjoint. Accordingly, . spanning trees are totally independent if they are pairwise totally independent. The problem of finding . totally independent spanning trees (KTIST) or proving that no such trees do exist is NP-Complete. We investigate KTIST and an optimization p作者: Dysplasia 時(shí)間: 2025-3-24 07:34
Z. Cohen,R. Wassef,S. Nordgren,R. Silvermanks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, .). In such context, we design efficient polynomial-time approximati作者: opportune 時(shí)間: 2025-3-24 10:45 作者: 咆哮 時(shí)間: 2025-3-24 17:48
Z. Cohen,R. Wassef,S. Nordgren,R. Silverman a subset of a set which maximizes a measure of dispersion/similarity between elements. To tackle the problem a two phases hybrid heuristic combining a mixed integer non linear solver and a local branching procedure is developed. Computational results, performed on literature instances, show that th作者: alleviate 時(shí)間: 2025-3-24 21:41
Z. Cohen,R. Wassef,S. Nordgren,R. Silvermanmakespan. This problem is known to be ordinary .-hard and the current state of the art algorithms can solve instances with up?to . jobs. We introduce a constraint generation approach to the integer linear programming (ILP) formulation of the problem according to which the constraints associated with作者: 減震 時(shí)間: 2025-3-25 01:05
Very Special and Difficult Cases into an edge-weighted graph ., ., where the cost of . is the distance between . and .. The . asks, for given . and ., to find a placement . such that the cost of a resulting shortest .-path in . is minimum among all graphs .. The . asks to find a placement . such that the cost of a resulting minimu作者: 飛行員 時(shí)間: 2025-3-25 03:55 作者: CROAK 時(shí)間: 2025-3-25 08:25 作者: Axillary 時(shí)間: 2025-3-25 12:47
978-3-319-09173-0Springer International Publishing Switzerland 2014作者: 責(zé)問 時(shí)間: 2025-3-25 17:02
0302-9743 ium on Combinatorial Optimization, ISCO 2014, held in Lisbon, Portugal, in March 2014. The 37 revised full papers presented together with 64 short papers were carefully reviewed and selected from 97 submissions. They present original research on all aspects of combinatorial optimization, such as alg作者: Lobotomy 時(shí)間: 2025-3-25 20:23 作者: 自負(fù)的人 時(shí)間: 2025-3-26 01:59
https://doi.org/10.1007/978-88-470-0667-6very ., and . if . for every induced subgraph . of ., and every induced subgraph . of ...We investigate the b-chromatic number of graphs with stability number two. These are exactly the complements of triangle-free graphs, thus including all complements of bipartite graphs. The main results of this work are the following:作者: 擁擠前 時(shí)間: 2025-3-26 06:35
Z. Cohen,R. Wassef,S. Nordgren,R. Silvermanty and approximation for which the compatibility graph is bipartite (star, chain, .). In such context, we design efficient polynomial-time approximation algorithms according to different parameters of the scheduling problem.作者: 討厭 時(shí)間: 2025-3-26 10:37
Z. Cohen,R. Wassef,S. Nordgren,R. Silvermana mixed integer non linear solver and a local branching procedure is developed. Computational results, performed on literature instances, show that the proposed procedure outperforms the state-of-the-art approaches.作者: 厚顏無(wú)恥 時(shí)間: 2025-3-26 12:45
Solving Graph Partitioning Problems Arising in Tagless Cache Management,nagement. A graph partitioning formulation is presented and different ILP formulations are proposed, obtained by strengthening and/or relaxing constraints and by reducing the number of integer variables. The formulations are tested on large benchmarks (with thousands of nodes and edges) arising from real applications.作者: 幾何學(xué)家 時(shí)間: 2025-3-26 18:24 作者: 逃避現(xiàn)實(shí) 時(shí)間: 2025-3-27 00:32 作者: 半球 時(shí)間: 2025-3-27 01:50
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Pa mixed integer non linear solver and a local branching procedure is developed. Computational results, performed on literature instances, show that the proposed procedure outperforms the state-of-the-art approaches.作者: 得罪 時(shí)間: 2025-3-27 06:48
The Dominating Set Polytope via Facility Location,imension. It is known from [.] that for any integer ., there exists a facet defining inequality having coefficients in .. We also show a decomposition theorem by means of 1-sums. Again this decomposition is much simpler with the extended formulation than with the node-variables formulation given in [.].作者: 微枝末節(jié) 時(shí)間: 2025-3-27 10:49 作者: 天賦 時(shí)間: 2025-3-27 15:23 作者: Horizon 時(shí)間: 2025-3-27 19:02
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection, nearly all potential critical paths are relaxed and then only the ones violated by the relaxed solution are sequentially reinstated. This approach yields a new solution algorithm capable of solving problems with up?to . jobs or more.作者: Orthodontics 時(shí)間: 2025-3-27 23:00
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods,m spanning tree is minimum among all graphs .. We study these problems in the . metric, and show that the shortest path problem with neighborhoods is solvable in polynomial time, whereas the minimum spanning tree problem with neighborhoods is .-hard, even if the neighborhood regions are segments.作者: 老人病學(xué) 時(shí)間: 2025-3-28 03:47 作者: Offensive 時(shí)間: 2025-3-28 10:11
https://doi.org/10.1007/978-3-319-01104-2 addressed by any black box-solver. An experimental evaluation shows that our approach clearly outperforms other methods for mean-variance optimization when applied to robust shortest path problems and to risk-averse capital budgeting problems arising in portfolio optimization.作者: 使乳化 時(shí)間: 2025-3-28 12:20
https://doi.org/10.1007/978-3-319-01104-2es a configuration based integer programming formulation for a randomized rounding procedure. In order to turn the rounded solution into a feasible solution, we define appropriate estimators that linearize the convex costs.作者: 切碎 時(shí)間: 2025-3-28 16:00
https://doi.org/10.1007/978-88-470-0667-6ed preprocessing phase, leading to a fast enumeration of the branch-and-bound nodes. Experimental results for randomly generated instances are presented. The new approach significantly outperforms the MIQP solver of CPLEX 12.4 for instances with a small number of constraints.作者: AXIOM 時(shí)間: 2025-3-28 21:36
N. Rotman,F. Michot,J. M. Hay,P. L. Fagniezns in the design of interconnection networks. We propose an integer programming formulation, valid inequalities and a Branch-and-cut algorithm to solve them. We also present an experimental evaluation of such an algorithm.作者: 使顯得不重要 時(shí)間: 2025-3-29 01:36 作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-29 05:43 作者: 和平主義者 時(shí)間: 2025-3-29 09:07 作者: 制定 時(shí)間: 2025-3-29 13:57 作者: Kindle 時(shí)間: 2025-3-29 18:26 作者: GEM 時(shí)間: 2025-3-29 23:36 作者: 鞠躬 時(shí)間: 2025-3-30 01:51 作者: 救護(hù)車 時(shí)間: 2025-3-30 04:37 作者: STRIA 時(shí)間: 2025-3-30 09:39
Computed Tomography Imaging Pathophysiology, and quality requirements. The model is based on bounded stochastic shortest path with finite state and action spaces. The commonly used schedule stability measure is put in the context of proposed family of flexibility measures and contrasted to them in the terms of project execution system properties.作者: GUILE 時(shí)間: 2025-3-30 13:51
https://doi.org/10.1007/978-3-642-71087-2the common adjacencies between . and .. While both problems are known to be NP-hard, their parameterized complexity when parameterized by the number of common adjacencies of the resulting genomes is still open. In this paper, we settle this open problem and we present fixed-parameter algorithms for the . problem and the . problem.作者: TIA742 時(shí)間: 2025-3-30 17:56
Study of Identifying Code Polyhedra for Some Families of Split Graphs,arch in order to apply similar techniques to obtain strong lower bounds stemming from linear relaxations of the identifying code polyhedron, enhanced by suitable cutting planes to be used in a B&C framework.作者: HPA533 時(shí)間: 2025-3-30 23:25
Parametric Multiroute Flow and Its Application to Robust Network with , Edge Failures,phs in a specific class. Our numerical experiments show that . of random graphs generated in the experiment are in that specific class. Given a parametric edge ., we also show that the function taking the capacity of . to the max-.-route flow value is linear piecewise. Hence we can apply our modified ES algorithm to find that function in ..作者: coagulate 時(shí)間: 2025-3-31 04:39
Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustn and quality requirements. The model is based on bounded stochastic shortest path with finite state and action spaces. The commonly used schedule stability measure is put in the context of proposed family of flexibility measures and contrasted to them in the terms of project execution system properties.作者: 容易生皺紋 時(shí)間: 2025-3-31 08:56
Fixed-Parameter Algorithms for Scaffold Filling,the common adjacencies between . and .. While both problems are known to be NP-hard, their parameterized complexity when parameterized by the number of common adjacencies of the resulting genomes is still open. In this paper, we settle this open problem and we present fixed-parameter algorithms for the . problem and the . problem.作者: Ruptured-Disk 時(shí)間: 2025-3-31 09:52 作者: figurine 時(shí)間: 2025-3-31 14:39
https://doi.org/10.1007/978-3-322-94415-3imension. It is known from [.] that for any integer ., there exists a facet defining inequality having coefficients in .. We also show a decomposition theorem by means of 1-sums. Again this decomposition is much simpler with the extended formulation than with the node-variables formulation given in [.].作者: 證實(shí) 時(shí)間: 2025-3-31 17:34
Detectors for Small-Animal SPECT I,fective preprocessing procedure to reduce the size of the input, introduce a GRASP heuristic which was able to find solutions very close to be optimal ones, propose an integer programming formulation for the problem and present computational experiments made with instances that come from an application.作者: commune 時(shí)間: 2025-3-31 23:54 作者: GRAVE 時(shí)間: 2025-4-1 02:27 作者: 制度 時(shí)間: 2025-4-1 07:41
Very Special and Difficult Casesm spanning tree is minimum among all graphs .. We study these problems in the . metric, and show that the shortest path problem with neighborhoods is solvable in polynomial time, whereas the minimum spanning tree problem with neighborhoods is .-hard, even if the neighborhood regions are segments.作者: 好色 時(shí)間: 2025-4-1 13:21 作者: 磨碎 時(shí)間: 2025-4-1 14:48
Maximum Throughput Network Routing Subject to Fair Flow Allocation,作者: 鐵塔等 時(shí)間: 2025-4-1 19:46
Study of Identifying Code Polyhedra for Some Families of Split Graphs,al graphs like bipartite graphs and split graphs. Hence, a typical line of attack for this problem is to determine minimum identifying codes of special graphs or to provide bounds for their size..In this work we study the associated polyhedra for some families of split graphs: headless spiders and c作者: 反省 時(shí)間: 2025-4-1 23:21
Parametric Multiroute Flow and Its Application to Robust Network with , Edge Failures,twork flow problems. We show that the function is piecewise hyperbolic, and modify a parametric optimization technique, the ES algorithm, to find this function. The running time of the algorithm is ., when . is a source-sink edge connectivity of our network, . is the number of links, and . is the nu作者: Surgeon 時(shí)間: 2025-4-2 03:00
The Dominating Set Polytope via Facility Location,ribe the dominating set polytope for cacti graphs, though its description in the natural node variables dimension has been only partially obtained. Moreover, the inequalities describing this polytope have coefficients in .. This is not the case for the dominating set polytope in the node-variables d作者: 死亡率 時(shí)間: 2025-4-2 10:41 作者: omnibus 時(shí)間: 2025-4-2 12:20
