標(biāo)題: Titlebook: Combinatorial Optimization; New Frontiers in The Mustafa Akgül,Horst W. Hamacher,Süleyman Tüfek?i Conference proceedings 1992 Springer-Verl [打印本頁(yè)] 作者: 重要 時(shí)間: 2025-3-21 17:21
書(shū)目名稱Combinatorial Optimization影響因子(影響力)
作者: 帳單 時(shí)間: 2025-3-21 21:39 作者: ANIM 時(shí)間: 2025-3-22 02:15
An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach fave been suggested in literature which reduce the computational complexity of this approach. One of these streams is based on ”scaling”..In this paper we shortly review some recently published scaling approaches, and we develop an appropriate data structure by which an efficient storage and use of t作者: Ingrained 時(shí)間: 2025-3-22 07:48
A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times,ighted sum of the start times. The basic formulation involves start time and sequence determining variables, and lower bounds on the start times. Its linear programming relaxation solves problems in which all release times are equal. For the general problem, good lower bounds are obtained by adding 作者: MUT 時(shí)間: 2025-3-22 12:24
The Linear Assignment Problem,y feasible trees. Most of them employ Dijkstra’s shortest path algorithm directly or indirectly. When properly implemented, each has the same complexity: O(..) for dense graphs with simple data structures and O(.. log . + .) for sparse graphs using Fibonacci Heaps.作者: MITE 時(shí)間: 2025-3-22 14:43
On Preference Orders for Sequencing Problems Or, What Hath Smith Wrought?,rm of a preference order. Over the years, the concept of a preference order has been much elaborated. It is now applied to abstract problems in optimal sequencing, with general precedence constraints being dealt with by the technique of modular decomposition. This paper provides a unified and self c作者: MITE 時(shí)間: 2025-3-22 20:00 作者: 沉積物 時(shí)間: 2025-3-22 21:28
Combinatorial Optimization Models Motivated by Robotic Assembly Problems, for sequencing the insertion points and locating the storage bins. The . used in this model is generalized and some algorithms for solving this general problem are described. Finally, we discuss . problems as models for multi objective problems..Emphasis will be on results obtained by the author in作者: CLAP 時(shí)間: 2025-3-23 04:44
Job Shop Scheduling,ime. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose is to find a schedule, i.e., an allocation of the operations to time intervals on the machines, that has minimum length.作者: 協(xié)定 時(shí)間: 2025-3-23 08:16
On the Construction of the Set of K-best Matchings and Their Use in Solving Constrained Matching Pr which require the iterative solution of the basic optimization problem over a restricted groundset, i.e. a restricted set of variables. In this paper we discuss the application of these schemes to the problem of finding the set of .-best perfect matchings in a graph. We show that the use of those f作者: 符合規(guī)定 時(shí)間: 2025-3-23 13:03 作者: MUT 時(shí)間: 2025-3-23 16:30
Genetic Algorithms: A New Approach to the Timetable Problem,g highly constrained optimization problems, where a minimal change to a feasible solution is very likely to yield an infeasible one. As a test problem, we have chosen the timetable problem (TTP), a problem that is known to be NP-hard [5], which has been intensively investigated for its practical rel作者: 反感 時(shí)間: 2025-3-23 18:06
Optimal Location of Concentrators in a Centralized Teleprocessing Network,ted network at gateway backbone nodes. In some cases, however, even large-scale networks are centralized systems. The terminals are linked together in groups sharing a multidrop line and connected to the host computer or to the backbone switch through a concentrator. By assuming that the terminals a作者: RADE 時(shí)間: 2025-3-23 22:53
A Column Generation Algorithm for the Vehicle Routing Problem with Time Windows,ere is a cost .., and a duration ... We assume that the service time of customer . is included in the duration of each arc (., .). In this paper, the cost is taken to be the distance between . and .. The vehicle routing problem with time windows (VRPTW) involves the design of a set of minimum cost r作者: 爭(zhēng)議的蘋(píng)果 時(shí)間: 2025-3-24 04:08 作者: 連詞 時(shí)間: 2025-3-24 08:10 作者: NIB 時(shí)間: 2025-3-24 12:03
The Linear Assignment Problem,y feasible trees. Most of them employ Dijkstra’s shortest path algorithm directly or indirectly. When properly implemented, each has the same complexity: O(..) for dense graphs with simple data structures and O(.. log . + .) for sparse graphs using Fibonacci Heaps.作者: Lipoprotein 時(shí)間: 2025-3-24 16:23
Job Shop Scheduling,ime. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose is to find a schedule, i.e., an allocation of the operations to time intervals on the machines, that has minimum length.作者: inhumane 時(shí)間: 2025-3-24 19:58
Genetic Algorithms: A New Approach to the Timetable Problem,g highly constrained optimization problems, where a minimal change to a feasible solution is very likely to yield an infeasible one. As a test problem, we have chosen the timetable problem (TTP), a problem that is known to be NP-hard [5], which has been intensively investigated for its practical relevance [2, 1]作者: SEMI 時(shí)間: 2025-3-25 01:00
The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method,n . × . square matrix. The pair (.,.) defines the . as follows: .Variables .. and .. for i = 1,...,. are called .. The coefficient in row . and column . of matrix . will be denoted by ... The solvability of . depends on the special properties of the coefficient matrix ..作者: Munificent 時(shí)間: 2025-3-25 06:49 作者: 眼界 時(shí)間: 2025-3-25 10:13 作者: Spina-Bifida 時(shí)間: 2025-3-25 13:20 作者: 難聽(tīng)的聲音 時(shí)間: 2025-3-25 17:56 作者: 小丑 時(shí)間: 2025-3-25 20:39
Recent Results in Cancer Researchave been suggested in literature which reduce the computational complexity of this approach. One of these streams is based on ”scaling”..In this paper we shortly review some recently published scaling approaches, and we develop an appropriate data structure by which an efficient storage and use of t作者: cornucopia 時(shí)間: 2025-3-26 01:13
W. Maassen,D. Greschuchna,I. Martinezighted sum of the start times. The basic formulation involves start time and sequence determining variables, and lower bounds on the start times. Its linear programming relaxation solves problems in which all release times are equal. For the general problem, good lower bounds are obtained by adding 作者: Platelet 時(shí)間: 2025-3-26 07:52 作者: induct 時(shí)間: 2025-3-26 08:37 作者: GNAT 時(shí)間: 2025-3-26 13:37 作者: ferment 時(shí)間: 2025-3-26 20:18
Marko Simoneti,Matija Rojec,Marko Rems for sequencing the insertion points and locating the storage bins. The . used in this model is generalized and some algorithms for solving this general problem are described. Finally, we discuss . problems as models for multi objective problems..Emphasis will be on results obtained by the author in作者: 組成 時(shí)間: 2025-3-26 21:23 作者: Sarcoma 時(shí)間: 2025-3-27 03:10
John D. Daniels,Marjan Svetli?i? which require the iterative solution of the basic optimization problem over a restricted groundset, i.e. a restricted set of variables. In this paper we discuss the application of these schemes to the problem of finding the set of .-best perfect matchings in a graph. We show that the use of those f作者: Hiatus 時(shí)間: 2025-3-27 05:53
Competitiveness of Small Countriesms (MCNFP). The algorithm combines linear—quadratic penalty forms with a linearization technique that takes advantage of the block structure of the constraint set. The resultant procedure solves a sequence of smaller problems and can also be executed in parallel. Complete papers discuss the algorith作者: 聯(lián)想記憶 時(shí)間: 2025-3-27 13:16
Unilateral Economic Liberalization,g highly constrained optimization problems, where a minimal change to a feasible solution is very likely to yield an infeasible one. As a test problem, we have chosen the timetable problem (TTP), a problem that is known to be NP-hard [5], which has been intensively investigated for its practical rel作者: 單挑 時(shí)間: 2025-3-27 17:34 作者: 榮幸 時(shí)間: 2025-3-27 20:54
https://doi.org/10.1007/978-3-319-04253-4ere is a cost .., and a duration ... We assume that the service time of customer . is included in the duration of each arc (., .). In this paper, the cost is taken to be the distance between . and .. The vehicle routing problem with time windows (VRPTW) involves the design of a set of minimum cost r作者: Presbycusis 時(shí)間: 2025-3-27 23:35 作者: 彩色的蠟筆 時(shí)間: 2025-3-28 02:37 作者: Chivalrous 時(shí)間: 2025-3-28 09:26 作者: Evacuate 時(shí)間: 2025-3-28 14:28
Small Countries in a Global EconomyIn this paper the minimal spanning tree . structure is analyzed by means of the distance random variable and Wroclaw Taxonomy algorithm [2].作者: 譏諷 時(shí)間: 2025-3-28 17:27
https://doi.org/10.1057/9780333977767The partitioning of the nodes of a hypergraph arises in many different design/layout applications. In particular, the . problem in . design, c.f. [2, 5, 9], can be represented as a hypergraph partitioning problem. The modules in the netlist correspond to nodes of the hypergraph and the nets correspond to the hyperedges.作者: MAIZE 時(shí)間: 2025-3-28 20:45 作者: 過(guò)濾 時(shí)間: 2025-3-28 23:03
An Analysis of the Minimal Spanning Tree Structure,In this paper the minimal spanning tree . structure is analyzed by means of the distance random variable and Wroclaw Taxonomy algorithm [2].作者: Stress-Fracture 時(shí)間: 2025-3-29 04:07 作者: dyspareunia 時(shí)間: 2025-3-29 07:43
Combinatorial Optimization978-3-642-77489-8Series ISSN 0258-1248 作者: 固定某物 時(shí)間: 2025-3-29 14:34 作者: HALL 時(shí)間: 2025-3-29 18:23
Small Countries in a Global Economyime. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose is to find a schedule, i.e., an allocation of the operations to time intervals on the machines, that has minimum length.作者: temperate 時(shí)間: 2025-3-29 23:16
Unilateral Economic Liberalization,g highly constrained optimization problems, where a minimal change to a feasible solution is very likely to yield an infeasible one. As a test problem, we have chosen the timetable problem (TTP), a problem that is known to be NP-hard [5], which has been intensively investigated for its practical relevance [2, 1]作者: FANG 時(shí)間: 2025-3-30 01:59 作者: CHYME 時(shí)間: 2025-3-30 07:34
NATO ASI Subseries F:http://image.papertrans.cn/c/image/229949.jpg作者: 鈍劍 時(shí)間: 2025-3-30 11:13 作者: 輕率看法 時(shí)間: 2025-3-30 14:11
Conference proceedings 1992ing. Being outside of Ankara, the capital of Turkey, Bilkent University gave the participants a great opportunity for exchanging ideas and discussing new theories and applications without much distraction. One of the primary goals of NATO ASIs is to bring together a group of scientists and research 作者: conduct 時(shí)間: 2025-3-30 16:40 作者: Infusion 時(shí)間: 2025-3-30 22:59
A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times,additional valid inequalities that are violated by the solution to the linear programming relaxation. We report computational results and suggest some modifications based on including additional variables that are likely to give even better results.作者: 大酒杯 時(shí)間: 2025-3-31 03:45
Dynamic Basis Partitioning for Network Flows with Side Constraints,results show that the proposed dynamic basis partitioning algorithm is up to 36 times more efficient than a regular basis partitioning algorithm on the problems encountered in solving emergency evacuation problems.作者: Kinetic 時(shí)間: 2025-3-31 06:18 作者: nuclear-tests 時(shí)間: 2025-3-31 11:29 作者: Stress-Fracture 時(shí)間: 2025-3-31 15:48 作者: 定點(diǎn) 時(shí)間: 2025-3-31 20:15 作者: Ossification 時(shí)間: 2025-4-1 01:09 作者: 休戰(zhàn) 時(shí)間: 2025-4-1 02:44 作者: 有偏見(jiàn) 時(shí)間: 2025-4-1 06:38 作者: 眨眼 時(shí)間: 2025-4-1 12:13
https://doi.org/10.1007/978-3-319-04253-4rminals they can accommodate. The problem to solve consists of determining the optimal number and location of the concentrators and of linking the facilities in tree hierarchical structure at minimum cost, without exceeding line and concentrator capacities.作者: 無(wú)脊椎 時(shí)間: 2025-4-1 17:50 作者: 光滑 時(shí)間: 2025-4-1 20:29
