:facetid:toc:\"db/journals/dam/dam65.bht\"OK:facetid:toc:db/journals/dam/dam65.bhtSrinivasa Rao ArikatiUri N. PeledA Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs.Discret. Appl. Math.651-35-201996Journal Articlesopenjournals/dam/ArikatiP9610.1016/0166-218X(95)00086-7https://doi.org/10.1016/0166-218X(95)00086-7https://dblp.org/rec/journals/dam/ArikatiP96URL#6681971David AvisKomei FukudaReverse Search for Enumeration.Discret. Appl. Math.651-321-461996Journal Articlesopenjournals/dam/AvisF9610.1016/0166-218X(95)00026-Nhttps://doi.org/10.1016/0166-218X(95)00026-Nhttps://dblp.org/rec/journals/dam/AvisF96URL#6681975Achim BachemWinfried HochstättlerMartin MalichThe Simulated Trading Heuristic for Solving Vehicle Routing Problems.Discret. Appl. Math.651-347-721996Journal Articlesopenjournals/dam/BachemHM9610.1016/0166-218X(95)00027-Ohttps://doi.org/10.1016/0166-218X(95)00027-Ohttps://dblp.org/rec/journals/dam/BachemHM96URL#6681977Claude BergeSome Properties of Non-bicolorable Hypergraphs and the Four-color Problem.Discret. Appl. Math.651-373-791996Journal Articlesopenjournals/dam/Berge9610.1016/0166-218X(95)00028-Phttps://doi.org/10.1016/0166-218X(95)00028-Phttps://dblp.org/rec/journals/dam/Berge96URL#6681984Jacek BlazewiczMaciej DrozdowskiDominique de WerraJan WeglarzDeadline Scheduling of Multiprocessor Tasks.Discret. Appl. Math.651-381-951996Journal Articlesopenjournals/dam/BlazewiczDWW9610.1016/0166-218X(95)00020-Rhttps://doi.org/10.1016/0166-218X(95)00020-Rhttps://dblp.org/rec/journals/dam/BlazewiczDWW96URL#6681987Peter BruckerJohann L. HurinkFrank Werner 0001Improving Local Search Heuristics for Some Scheduling Problems-I.Discret. Appl. Math.651-397-1221996Journal Articlesopenjournals/dam/BruckerHW9610.1016/0166-218X(95)00030-Uhttps://doi.org/10.1016/0166-218X(95)00030-Uhttps://dblp.org/rec/journals/dam/BruckerHW96URL#6681995Rainer E. BurkardRüdiger RudolfGerhard J. WoegingerThree-dimensional Axial Assignment Problems with Decomposable Cost Coefficients.Discret. Appl. Math.651-3123-1391996Journal Articlesopenjournals/dam/BurkardRW9610.1016/0166-218X(95)00031-Lhttps://doi.org/10.1016/0166-218X(95)00031-Lhttps://dblp.org/rec/journals/dam/BurkardRW96URL#6681997Jacques CarlierCorinne LucetA Decomposition Algorithm for Network Reliability Evaluation.Discret. Appl. Math.651-3141-1561996Journal Articlesopenjournals/dam/CarlierL9610.1016/0166-218X(95)00032-Mhttps://doi.org/10.1016/0166-218X(95)00032-Mhttps://dblp.org/rec/journals/dam/CarlierL96URL#6681998Maurice CochandArlette Gaillardon Preemptive Scheduling: A General Setting for the Two-phase Method.Discret. Appl. Math.651-3157-1661996Journal Articlesopenjournals/dam/CochandG9610.1016/0166-218X(95)00033-Nhttps://doi.org/10.1016/0166-218X(95)00033-Nhttps://dblp.org/rec/journals/dam/CochandG96URL#6682007Yang DaiHiroshi ImaiKazuo IwanoNaoki KatohKeiji OhtsukaNobuhiko YoshimuraA New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms.Discret. Appl. Math.651-3167-1901996Journal Articlesopenjournals/dam/DaiIIKOY9610.1016/0166-218X(95)00034-Ohttps://doi.org/10.1016/0166-218X(95)00034-Ohttps://dblp.org/rec/journals/dam/DaiIIKOY96URL#6682010Mauro Dell'AmicoFrancesco Maffiolion Some Multicriteria Arborescence Problems: Complexity and Algorithms.Discret. Appl. Math.651-3191-2061996Journal Articlesopenjournals/dam/DellAmicoM9610.1016/0166-218X(95)00035-Phttps://doi.org/10.1016/0166-218X(95)00035-Phttps://dblp.org/rec/journals/dam/DellAmicoM96URL#6682011Reinhardt EulerHervé Le VergeTime-tables, Polyhedra and the Greedy Algorithm.Discret. Appl. Math.651-3207-2211996Journal Articlesopenjournals/dam/EulerV9610.1016/0166-218X(95)00036-Qhttps://doi.org/10.1016/0166-218X(95)00036-Qhttps://dblp.org/rec/journals/dam/EulerV96URL#6682019Fred W. GloverEjection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems.Discret. Appl. Math.651-3223-2531996Journal Articlesopenjournals/dam/Glover9610.1016/0166-218X(94)00037-Ehttps://doi.org/10.1016/0166-218X(94)00037-Ehttps://dblp.org/rec/journals/dam/Glover96URL#6682029Peter L. HammerAlexander K. KelmansLaplacian Spectra and Spanning Trees of Threshold Graphs.Discret. Appl. Math.651-3255-2731996Journal Articlesopenjournals/dam/HammerK9610.1016/0166-218X(94)00049-Jhttps://doi.org/10.1016/0166-218X(94)00049-Jhttps://dblp.org/rec/journals/dam/HammerK96URL#6682036Pierre HansenMaolin ZhengShortest Shortest Path Trees of a Network.Discret. Appl. Math.651-3275-2841996Journal Articlesopenjournals/dam/HansenZ9610.1016/0166-218X(95)00038-Shttps://doi.org/10.1016/0166-218X(95)00038-Shttps://dblp.org/rec/journals/dam/HansenZ96URL#6682038Alain HertzYves MottetYves Rochaton a Scheduling Problem in a Robotized Analytical System.Discret. Appl. Math.651-3285-3181996Journal Articlesopenjournals/dam/HertzMR9610.1016/0166-218X(95)00039-Thttps://doi.org/10.1016/0166-218X(95)00039-Thttps://dblp.org/rec/journals/dam/HertzMR96URL#6682045Alain HertzMaurice QueyranneMarino WidmerPreface.Discret. Appl. Math.651-31-31996Journal Articlesopenjournals/dam/HertzQW9610.1016/0166-218X(96)90005-0https://doi.org/10.1016/0166-218X(96)90005-0https://dblp.org/rec/journals/dam/HertzQW96URL#6682046Alain HertzMarino WidmerAn Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints.Discret. Appl. Math.651-3319-3451996Journal Articlesopenjournals/dam/HertzW9610.1016/0166-218X(95)00040-Xhttps://doi.org/10.1016/0166-218X(95)00040-Xhttps://dblp.org/rec/journals/dam/HertzW96URL#6682047Anthony J. W. HiltonJiping LiuCheng ZhaoGraphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle.Discret. Appl. Math.651-3347-3771996Journal Articlesopenjournals/dam/HiltonLZ9610.1016/0166-218X(95)00041-Ohttps://doi.org/10.1016/0166-218X(95)00041-Ohttps://dblp.org/rec/journals/dam/HiltonLZ96URL#6682048Chính T. HoàngA Note on Perfectly orderable Graphs.Discret. Appl. Math.651-3379-3861996Journal Articlesopenjournals/dam/Hoang9610.1016/0166-218X(95)00042-Phttps://doi.org/10.1016/0166-218X(95)00042-Phttps://dblp.org/rec/journals/dam/Hoang96URL#6682049Jenö LehelFrédéric MaffrayMyriam PreissmannGraphs with Largest Number of Minimum Cuts.Discret. Appl. Math.651-3387-4071996Journal Articlesopenjournals/dam/LehelMP9610.1016/0166-218X(95)00043-Qhttps://doi.org/10.1016/0166-218X(95)00043-Qhttps://dblp.org/rec/journals/dam/LehelMP96URL#6682061Marcus PattlochGünter Schmidt 0002Lot-size Scheduling of Two Types of Jobs on Identical Machines.Discret. Appl. Math.651-3409-4191996Journal Articlesopenjournals/dam/PattlochS9610.1016/0166-218X(95)00044-Rhttps://doi.org/10.1016/0166-218X(95)00044-Rhttps://dblp.org/rec/journals/dam/PattlochS96URL#6682079Henry ShumLeslie E. Trotter Jr.Cardinality-restricted Chains and Antichains in Partially ordered Sets.Discret. Appl. Math.651-3421-4391996Journal Articlesopenjournals/dam/ShumT9610.1016/0166-218X(95)00045-Shttps://doi.org/10.1016/0166-218X(95)00045-Shttps://dblp.org/rec/journals/dam/ShumT96URL#6682095