Call for papers *2**ndInternational SymposiumonCombinatorial Optimization(ISCO 2012) April 19-21, 2012* * * * * * SpringSchool **"/M//athematical Programmingand DesignofApproximation Algorithms/" April 17-18, 2012* * * ** * ****** * * Athens UniversityofEconomicsandBusiness, Athens, Greece* http://isco12.cs.aueb.gr/ <http://isco12.cs.aueb.gr/> <http://isco12.cs.aueb.gr/> <http://isco12.cs.aueb.gr/>ISCOisanewbiannualsymposiumwithitsfirstissueheldinHammamet,Tunisiain March 2010. The symposium aims to bring together researchers from all the communitiesrelatedto combinatorial optimization,including algorithmsand complexity,mathematicalprogrammingandoperationsresearch.Itisintendedtobe a forum for presenting original research in these areas and especially in their intersections. Quality papers on all aspects of combinatorial optimization, from mathematical foundationsandtheoryof algorithmstocomputationalstudies and practical applications,are solicited. *S**pring School* ISCO2012willbeprecededbyaspringschoolon"MathematicalProgrammingand DesignofApproximationAlgorithms".DavidShmoysandDavidWilliamsonwillgive 16hoursoflectures onApril 17-18, 2012. *I**nvited Speakers* Giorgio Ausiello,Universitàdi Roma"LaSapienza" ChristosPapadimitriou, UC Berkeley GeorgeNemhauser,GeorgiaTech PaoloToth, Universitàdi Bologna *I**mportant Dates* Submissionsdeadline:December 1, 2011 Notification ofauthors: January30,2012 Earlyregistrationdeadline:February24, 2012 Spring School:April 17-18,2012 Conference:April19-21,2012 Camerareadyversion: May4,2012 *S**ubmission- Publication* Paperspresentingoriginal unpublished resultsinall areasofcombinatorial optimizationand its applicationsare welcome. Topicsofinterestinclude,butare not limitedto: ·Approximation algorithms ·Branch-and-bound algorithms ·Branch-and-cut-and-price algorithms ·Computational biology ·Computational complexity ·Computational geometry ·Constraint Programming ·Cuttingplane algorithms ·Exactand parameterizedalgorithms ·Graphand networkalgorithms ·Interiorpointmethods ·Linearand nonlinearintegerprogramming ·Local searchalgorithms ·Metaheuristics ·On-linealgorithms ·Polyhedral combinatorics ·Randomizedalgorithms ·Schedulingalgorithms ThesubmissiondeadlineisThursdayDecember1,2011.Simultaneoussubmissions tootherconferenceswithpublishedproceedingsorjournalsarenotallowed. Paper submissionandreviewingwillbehandledonlyviaEasychair.Moreinformationabout thesubmissionprocedure will beavailable induetime. There will betwo typesofsubmissions: a)Regularpapers Theyshould beofatmost12pages,includingfrontmatterandbibliography,in LNCS style (seehttp://www.springer.de/comp/lncs/authors.html) <http://www.springer.de/comp/lncs/authors.html>. Proofs omitted due to space constraintsshouldbeincluded inaclearlymarkedappendixwhichwillbe takenintoaccountbytheprogramcommitteemembers andthereviewers,butitwill notbepublished intheproceedings. AcceptedregularpaperswillbepublishedbySpringer-VerlagintheLectureNotesin ComputerScience(LNCS)seriesinapost-conferenceproceedingsvolume.Fora papertobeincludedinthisvolume, itshouldbepresentedattheconferencebyone oftheauthors.Theauthorswillhavetopreparetheircamera-ready version two weeksaftertheend of ISCO 2012. b)Shortpapers Theyshouldbeofatmost4pages(includingfrontmatterandbibliography)withno optional appendix. Accepted short papers will be included in a volume of local proceedingsandwill be presented intheconference. Special Issues Selected paperspresentedat the conferencewill beinvitedtospecial issues devotedtotheevent that will bepublished ininternational journals. ** -- ----------------------------------------- A. Ridha Mahjoub Laboratoire LAMSADE Université Paris Dauphine Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16 France Tel: +33 (0)1 44 05 48 96 Fax: +33 (0)1 44 05 40 91 E-mail:mahjoub@lamsade.dauphine.fr URL:http://www.lamsade.dauphine.fr/~mahjoub