Mathematical programming

Mathematical programming 23 registres trobats  La cerca s'ha fet en 0.01 segons. 
1.
2 p, 80.7 KB Lectures on Mathematical Programming ismp97 / Liebling, T.M. ; de Werra, D.
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 1-2  
 Accés restringit a la UAB
2.
16 p, 789.7 KB How to deal with the unbounded in optimization : Theory and algorithms / Auslender, A.
The aim of this survey is to show how the unbounded arises in optimization problems and how it leads to fundamental notions which are not only useful for proving theoretical results such as convergence of algorithms and the existence of optimal solutions, but also for constructing new methods. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 3-18  
 Accés restringit a la UAB
3.
13 p, 579.0 KB A modified lift-and-project procedure / Balas, Egon
In recent years the lift-and-project approach has been used successfully within a branch-and-cut framework to solve large, difficult pure and mixed 0-1 programs that have resisted solution efforts by pure branch and bound codes. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 19-31  
 Accés restringit a la UAB
4.
21 p, 1.1 MB Measure concentration in optimization / Barvinok, Alexander
We discuss some consequences of the measure concentration phenomenon for optimization and computational problems. Topics include average case analysis in optimization, efficient approximate counting, computation of mixed discriminants and permanents, and semidefinite relaxation in quadratic programming. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 33-53  
 Accés restringit a la UAB
5.
15 p, 845.3 KB Efficiently solvable special cases of hard combinatorial optimization problems / Burkard, Rainer E.
We survey some recent advances in the field of polynomially solvable special cases of hard combinatorial optimization problems like the travelling salesman problem, quadratic assignment problems and Steiner tree problems. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 55-69  
 Accés restringit a la UAB
6.
27 p, 1.6 MB Two applications of the Divide&Conquer principle in the molecular sciences / Brinkmann, G. ; Dress, A.W.M. ; Perrey, S.W. ; Stoye, J.
In this paper, two problems from the molecular sciences are addressed: the enumeration of fullerene-type isomers and the alignment of biosequences. We report on two algorithms dealing with these problems both of which are based on the well-known and widely used Divide&Conquer principle. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 71-97  
 Accés restringit a la UAB
7.
25 p, 1.7 MB Interactions between nonlinear programming and modeling systems / Drud, Arne Stolbjerg
Modeling systems are very important for bringing mathematical programming software to non-expert users, but few nonlinear programming algorithms are today linked to a modeling system. The paper discussed the advantages of linking modeling systems with nonlinear programming. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 99-123  
 Accés restringit a la UAB
8.
17 p, 1005.0 KB Algorithms for railway crew management / Caprara, Alberto ; Fischetti, Matteo ; Toth, Paolo ; Vigo, Daniele ; Guida, Pier Luigi
Crew management is concerned with building the work schedules of crews needed to cover a planned timetable. This is a well-known problem in Operations Research and has been historically associated with airlines and mass-transit companies. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 125-141  
 Accés restringit a la UAB
9.
19 p, 1.1 MB Semidefinite programming in combinatorial optimization / Goemans, Michel X.
We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovász theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of finite metric spaces and its relationship to the sparsest cut problem. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 143-161  
 Accés restringit a la UAB
10.
28 p, 1.4 MB Logical analysis of numerical data / Boros, Endre ; Hammer, Peter L. ; Ibaraki, Toshihide ; Kogan, Alexander
"Logical analysis of data" (LAD) is a methodology developed since the late eighties, aimed at discovering hidden structural information in data sets. LAD was originally developed for analyzing binary data by using the theory of partially defined Boolean functions. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 163-190  
 Accés restringit a la UAB
11.
25 p, 1.4 MB Cluster analysis and mathematical programming / Hansen, Pierre ; Jaumard, Brigitte
Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clustering and criteria for homogeneity or separation are of interest, this is a vast field. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 191-215  
 Accés restringit a la UAB
12.
17 p, 910.0 KB Linear programming, the simplex algorithm and simple polytopes / Kalai, Gil
In the first part of the paper we survey some far-reaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 217-233  
 Accés restringit a la UAB
13.
19 p, 807.5 KB Exploiting sparsity in primal-dual interior-point methods for semidefinite programming / Fujisawa, Katsuki ; Kojima, Masakazu ; Nakata, Kazuhide
The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and Nesterov-Todd search directions have been used in many primal-dual interior-point methods for semidefinite programs. This paper proposes an efficient method for computing the two directions when the semidefinite program to be solved is large scale and sparse. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 235-253  
 Accés restringit a la UAB
14.
29 p, 1.7 MB Cuts, matrix completions and graph rigidity / Laurent, Monique
This paper brings together several topics arising in distinct areas: polyhedral combinatorics, in particular, cut and metric polyhedra; matrix theory and semidefinite programming, in particular, completion problems for positive semidefinite matrices and Euclidean distance matrices; distance geometry and structural topology, in particular, graph realization and rigidity problems. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 255-283  
 Accés restringit a la UAB
15.
13 p, 702.2 KB Interior-point methods : An old and new approach to nonlinear programming / Nesterov, Yu.
In this paper we discuss the main concepts of structural optimization, a field of nonlinear programming, which was formed by the intensive development of modern interior-point schemes. .
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 285-297  
 Accés restringit a la UAB
16.
34 p, 2.0 MB Error bounds in mathematical programming / Pang, Jong-Shi
Originated from the practical implementation and numerical considerations of iterative methods for solving mathematical programs, the study of error bounds has grown and proliferated in many interesting areas within mathematical programming. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 299-332  
 Accés restringit a la UAB
17.
21 p, 1.1 MB Decomposition methods in stochastic programming / Ruszczynski, Andrzej
Stochastic programming problems have very large dimension and characteristic structures which are tractable by decomposition. We review basic ideas of cutting plane methods, augmented Lagrangian and splitting methods, and stochastic decomposition methods for convex polyhedral multi-stage stochastic programming problems. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 333-353  
 Accés restringit a la UAB
18.
14 p, 611.7 KB Test sets for integer programs / Scarf, Herbert E.
In this paper I discuss various properties of the simplicial complex of maximal lattice free bodies associated with a matrix A. If the matrix satisfies some mild conditions, and is generic, the edges of the complex form the minimal test set for the family of integer programs obtained by selecting a particular row of A as the objective function, and using the remaining rows to impose constraints on the integer variables. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 355-368  
 Accés restringit a la UAB
19.
27 p, 1.5 MB Criss-cross methods : A fresh view on pivot algorithms / Fukuda, Komei ; Terlaky, Tamás
Criss-cross methods are pivot algorithms that solve linear programming problems in one phase starting with any basic solution. The first finite criss-cross method was invented by Chang, Terlaky and Wang independently. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 369-395  
 Accés restringit a la UAB
20.
18 p, 1.1 MB Recent progress in unconstrained nonlinear optimization without derivatives / Conn, A.R. ; Scheinberg, K. ; Toint, Ph.L.
We present an introduction to a new class of derivative free methods for unconstrained optimization. We start by discussing the motivation for such methods and why they are in high demand by practitioners. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 397-414  
 Accés restringit a la UAB
21.
30 p, 1.8 MB Discrete optimization in public rail transport / Bussieck, M.R. ; Winter, T. ; Zimmermann, U.T.
Many problems arising in traffic planning can be modelled and solved using discrete optimization. We will focus on recent developments which were applied to large scale real world instances. Most railroad companies apply a hierarchically structured planning process. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 415-444  
 Accés restringit a la UAB
22.
22 p, 1.1 MB Free material optimization via mathematical programming / Zowe, Jochem ; Kocvara, Michal ; Bendsøe, Martin P.
This paper deals with a central question of structural optimization which is formulated as the problem of finding the stiffest structure which can be made when both the distribution of material as well as the material itself can be freely varied. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 445-466  
 Accés restringit a la UAB
23.
2 p, 56.2 KB Author Index Volume 79
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 467-468  
 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.