Journals in DBLP
O. Bahn , Jean-Louis Goffin , Jean-Philippe Vial , O. Du Merle Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:3-23 [Journal ] Hans-Jürgen Bandelt , Yves Crama , Frits C. R. Spieksma Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:25-50 [Journal ] Alain Billionnet , Marie-Christine Costa Solving the Uncapacited Plant Location Problem on Trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:51-59 [Journal ] Gary S. Bloom , Sergio Ruiz Decompositions into Linear Forests and Difference Labelings of Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:61-75 [Journal ] Endre Boros , Peter L. Hammer , Mark E. Hartmann , Ron Shamir Balancing Problems in Acyclic Networks. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:77-93 [Journal ] Richard C. Brewster The Complexity of Colouring Symmetric Relational Systems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:95-105 [Journal ] Peter Brucker , Bernd Jurisch , Bernd Sievers A Branch and Bound Algorithm for the Job-Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:107-127 [Journal ] Philippe Chrétienne Tree Scheduling with Communication Delays. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:129-141 [Journal ] M. Chochand Probabilistic Estimates for the Generalized Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:143-163 [Journal ] Dominique de Werra , Y. Gay Chromatic Scheduling and Frequency Assignment. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:165-174 [Journal ] Didier Fayard , Gérard Plateau An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:175-187 [Journal ] Arnaud Freville , Gérard Plateau An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:189-212 [Journal ] Joseph A. Gallian A Guide to the Graph Labeling Zoo. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:213-229 [Journal ] Fred Glover Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms). [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:231-255 [Journal ] Alain Hertz , Brigitte Jaumard , Marcus Poggi de Aragão Local Optima Topology for the k -Coloring Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:257-280 [Journal ] Bruno Leclerc Medians for Weight Metrics in the Covering Graphs of Semilattices. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:281-297 [Journal ] François Margot Some Complexity Results about Threshold Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:299-308 [Journal ] Uri N. Peled , Bruno Simeone A O(nm )-Time Algorithm for Computing the Dual of a Regular Boolean Function. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:309-323 [Journal ] Uri N. Peled , Feng Sun Total Matchings and Total Coverings of Threshold Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:325-330 [Journal ] Fred S. Roberts , Yonghua Xu On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:331-356 [Journal ] Hanif D. Sherali , Sridhar Ramachandran , Seong-In Kim A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:357-378 [Journal ]