![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Discrete Applied Mathematics, Volume 14
Volume 14, Number 1, May 1986
- Thomas Andreae:
On an extremal problem concerning the interval number of a graph. 1-9 - Roy H. Goetschel Jr.:
Linear objective functions on certain classes of greedoids. 11-16 - Dorit S. Hochbaum, Edna Wigderson:
The Linzertorte problem, or a unified approach to painting, baking and weaving. 17-32 - Hiroshi Kaneko, Masanori Fushimi:
A polymatroid associated with convex games. 33-45 - T. F. Lin:
A system of linear equations related to the transportation problem with application to probability theory. 47-56 - Azaria Paz:
A duality property for the set of all feasible solutions to an integer program. 57-66 - Franz Josef Radermacher:
Schedule-induced posets. 67-91 - J. Michael Steele, William L. Steiger:
Algorithms and complexity for least median of squares regression. 93-100 - Ding-Zhu Du:
An optimization problem on graphs. 101-104 - Aldo de Luca, Antonio Massarotti:
A decision procedure on partially commutative free monoids. 105-108
Volume 14, Number 2, June 1986
- Giorgio Gallo, Francesco Maffioli:
Preface. 109-110 - Alexander Schrijver:
Polyhedral proof methods in combinatorial optimization. 111-133 - Gerard A. P. Kindervater, Jan Karel Lenstra:
An introduction to parallelism in combinatorial optimization. 135-156 - Francesco Maffioli:
Randomized algorithms in combinatorial optimization: A survey. 157-170 - A. H. G. Rinnooy Kan:
An introduction to the analysis of approximation algorithms. 171-185 - J. B. G. Frenk
, A. H. G. Rinnooy Kan:
The rate of convergence to optimality of the LPT rule. 187-197 - Tony J. Van Roy, Laurence A. Wolsey:
Valid inequalities for mixed 0-1 programs. 199-213
Volume 14, Number 3, July 1986
- Martin Aigner:
Search problems on graphs. 215-230 - R. Chandrasekaran:
Recognition of Gilmore-Gomory traveling salesman problem. 231-238 - Charles J. Colbourn, William L. Kocay, Douglas R. Stinson:
Some NP-complete problems for hypergraph degree sequences. 239-254 - Craig Cordes, K. B. Reid:
Largest polygons with vertices in a given finite set. 255-262 - Harold Greenberg:
On equivalent knapsack problems. 263-268 - Pierre Hansen, Bruno Simeone:
Unimodular functions. 269-281 - Bruno Simeone:
An asymptotically exact polynomial algorithm for equipartition problems. 283-293 - Maurice Tchuenté:
Computation on binary tree-networks. 295-310
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.