Changes between Version 14 and Version 15 of AlkMod2017

Timestamp:

11/16/17 12:38:20 (6 years ago)

Author:

Alpar Juttner

Comment:

--

AlkMod2017

@@ -17 +17 @@
 This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.
 
-== November 29. ==
+== November 29. --- Ujszászi Zoltán ==
+
+[attachment:LecturesIntroBundle.pdf​ Alexandre Belloni. ''Lecture Notes for IAP 2005 Course Introduction to Bundle Methods'']
+
+== December 6. ==
 
 [attachment:garg97faster.pdf​ Naveen Garg, Jochen Konemann. ''Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems'']
@@ -23 +27 @@
 This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min-cost multicommodity flow; this yields much faster algorithms when the number of commodities is large.
 
-== December 6. ==
-
-[attachment:LecturesIntroBundle.pdf​ Alexandre Belloni. ''Lecture Notes for IAP 2005 Course Introduction to Bundle Methods'']
 
 == December 13. ==