Mathematical programming

Mathematical programming 12 registres trobats  La cerca s'ha fet en 0.01 segons. 
1.
4 p, 301.7 KB Network Optimization : Algorithms and Applications / Gallo, G. ; Grigoriadis, M.D.
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 105-108  
 Accés restringit a la UAB
2.
21 p, 1.1 MB A polynomial time primal network simplex algorithm for minimum cost flows / Orlin, James B.
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we develop one such algorithm that runs in O(min(n^2m log nC, n^2m^2 log n)) time, where n is the number of nodes in the network, m is the number of arcs, and C denotes the maximum absolute arc costs if arc costs are integer and (infin) otherwise. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 109-129  
 Accés restringit a la UAB
3.
18 p, 973.6 KB A new strongly polynomial dual network simplex algorithm / Armstrong, Ronald D. ; Jin, Zhiying
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 131-148  
 Accés restringit a la UAB
4.
10 p, 591.4 KB A new pivot selection rule for the network simplex algorithm / Sokkalingam, P.T. ; Sharma, Prabha ; Ahuja, Ravindra K.
We present a new network simplex pivot selection rule, which we call the minimum ratio pivot rule, and analyze the worst-case complexity of the resulting network simplex algorithm. We consider networks with n nodes, m arcs, integral arc capacities and integral supplies/demands of nodes. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 149-158  
 Accés restringit a la UAB
5.
10 p, 543.6 KB On strongly polynomial dual simplex algorithms for the maximum flow problem / Goldfarb, Donald ; Wei, Chen
Several pivot rules for the dual network simplex algorithm that enable it to solve a maximum flow problem on an n-node, m-arc network in at most 2nm pivots and O(n^2m) time are presented. These rules are based on the concept of a preflow and depend upon the use of node labels which are either the lengths of a shortest pseudoaugmenting path from those nodes to the sink node or valid underestimates of those lengths. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 159-168  
 Accés restringit a la UAB
6.
9 p, 549.8 KB Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm / Tarjan, Robert E.
The dynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges (linking) and splitting by deleting edges (cutting), while at the same time allowing reporting of certain combinations of vertex or edge values. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 169-177  
 Accés restringit a la UAB
7.
16 p, 999.8 KB How to compute least infeasible flows / McCormick, S. Thomas
It is well-known how to use maximum flow to decide when a flow problem with demands, lower bounds, and upper bounds is infeasible. Less well-known is how to compute a flow that is least infeasible. This paper considers many possible ways to define "least infeasible" and shows how to compute optimal flows for each definition. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 179-194  
 Accés restringit a la UAB
8.
23 p, 998.3 KB Flows on hypergraphs / Cambini, Riccardo ; Gallo, Giorgio ; Scutellà, Maria Grazia
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 195-217  
 Accés restringit a la UAB
9.
24 p, 1.3 MB Multiflows and disjoint paths of minimum total cost / Karzanov, Alexander V.
In this paper we discuss a number of recent and earlier results in the field of combinatorial optimization that concerns problems on minimum cost multiflows (multicommodity flows) and edge-disjoint paths. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 219-242  
 Accés restringit a la UAB
10.
21 p, 1.2 MB A branch-and-cut algorithm for the equicut problem / Brunetta, Lorenzo ; Conforti, Michel ; Rinaldi, Giovanni
We describe an algorithm for solving the equicut problem on complete graphs. The core of the algorithm is a cutting-plane procedure that exploits a subset of the linear inequalities defining the convex hull of the incidence vectors of the edge sets that define an equicut. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 243-263  
 Accés restringit a la UAB
11.
17 p, 989.4 KB The Steiner tree packing problem in VLSI design / Grötschel, M. ; Martin, A. ; Weismantel, R.
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 265-281  
 Accés restringit a la UAB
12.
21 p, 1.1 MB Minimum-perimeter domain assignment / Yackel, Jonathan ; Meyer, Robert R. ; Christou, Ioannis
For certain classes of problems defined over two-dimensional domains with grid structure, optimization problems involving the assignment of grid cells to processors present a nonlinear network model for the problem of partitioning tasks among processors so as to minimize interprocessor communication. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 283-303  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.