Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 18
Volume 18, Number 1, September 1987
- Esther M. Arkin, Ellen B. Silverberg:
Scheduling jobs with fixed start and end times. 1-8 - Johann Blieberger:
Monotonically labelled Motzkin trees. 9-24 - William J. Cook, Collette R. Coullard, György Turán:
On the complexity of cutting-plane proofs. 25-38 - Eric Goles Ch., Servet Martínez A.:
Properties of positive functions and the dynamics of associated automata networks. 39-46 - Terry A. McKee:
Multiterminal duality and three-terminal series-parallelness. 47-53 - Victor J. Rayward-Smith:
UET scheduling with unit interprocessor communication delays. 55-71 - Keisuke Uchimura:
Divisor generating functions and insertion into a heap. 73-81 - Ph. Borie:
Reseaux et polynomes de denombrement. 83-86 - Samuel W. Bent, Udi Manber:
On non-intersecting Eulerian circuits. 87-94 - Iiro S. Honkala, Heikki O. Hämäläinen, Markku K. Kaikkonen:
Some lower bounds for constant weight codes. 95-98 - J. Michael Steele:
On Frieze's χ(3) limit for lengths of minimal spanning trees. 99-103
Volume 18, Number 2, November 1987
- Ruy Eduardo Campello, Gerd Finke:
Preface. 105 - Paulo Bárcia:
Constructive dual methods for discrete programming. 107-117 - Ruy Eduardo Campello, Nelson Maculan:
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms. 119-136 - Giorgio Carpaneto, Paolo Toth:
Primal-dual algrorithms for the assignment problem. 137-153 - Chandra R. Chegireddy, Horst W. Hamacher:
Algorithms for finding K-best perfect matchings. 155-165 - Søren Holm:
Adding activities to the dual instead of cuts to the primal problem. 167-174 - Andrew Kusiak, Gerd Finke:
Hierarchical approach to the process planning problem. 175-184 - Gilbert Laporte, Hélène Mercure, Yves Nobert:
Generalized travelling salesman problem through n sets of nodes: the asymmetrical case. 185-197 - Henrique Pacca L. Luna, Nivio Ziviani, Regina Helena B. Cabral:
The telephonic switching centre network problem: formalization and computational experience. 199-210 - Catherine Roucairol:
A parallel branch and bound algorithm for the quadratic assignment problem. 211-225 - Jayme Luiz Szwarcfiter:
Job shop scheduling with unit time operations under resource constraints and release dates. 227-233 - Horacio Hideki Yanasse
, Nei Yoshihiro Soma:
A new enumeration scheme for the knapsack problem. 235-245
Volume 18, Number 3, December 1987
- L. Borzacchini:
Graphical partially ordered sets. 247-262 - Alexander V. Karzanov:
Half-integral five-terminus flows. 263-278 - Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart:
Bipartite permutation graphs. 279-292 - Zsolt Tuza:
On the context-free production complexity of finite languages. 293-304
- Qi Ning:
On a conjecture of Foulds and Robinson about deltahedra. 305-308
- Gerhard Larcher, Robert F. Tichy:
A note on gray code and odd-even merge. 309-313 - Ivan Mezník:
On some structural properties of a subclass of ∞-regular languages. 315-319 - Peter C. Fishburn:
Letter to the editor. 321
a service of 
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.
last updated on 2024-05-10 18:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
