Andrea Lodi – författare
Visar alla böcker från författaren Andrea Lodi. Handla med fri frakt och snabb leverans.
7 produkter
7 produkter
994 kr
Skickas inom 7-10 vardagar
Primal heuristics guarantee that feasible, high-quality solutions are provided at an early stage of the solving process, and thus are essential to the success of mixed-integer programming (MIP). By helping prove optimality faster, they allow MIP technology to extend to a wide variety of applications in discrete optimization. This first comprehensive guide to the development and use of primal heuristics within MIP technology and solvers is ideal for computational mathematics graduate students and industry practitioners. Through a unified viewpoint, it gives a unique perspective on how state-of-the-art results are integrated within the branch-and-bound approach at the core of the MIP technology. It accomplishes this by highlighting all the required knowledge needed to push the heuristic side of MIP solvers to their limit and pointing out what is left to do to improve them, thus presenting heuristic approaches for MIP as part of the MIP solving process.
385 kr
Skickas inom 7-10 vardagar
Primal heuristics guarantee that feasible, high-quality solutions are provided at an early stage of the solving process, and thus are essential to the success of mixed-integer programming (MIP). By helping prove optimality faster, they allow MIP technology to extend to a wide variety of applications in discrete optimization. This first comprehensive guide to the development and use of primal heuristics within MIP technology and solvers is ideal for computational mathematics graduate students and industry practitioners. Through a unified viewpoint, it gives a unique perspective on how state-of-the-art results are integrated within the branch-and-bound approach at the core of the MIP technology. It accomplishes this by highlighting all the required knowledge needed to push the heuristic side of MIP solvers to their limit and pointing out what is left to do to improve them, thus presenting heuristic approaches for MIP as part of the MIP solving process.
Del 11480 - Lecture Notes in Computer Science
Integer Programming and Combinatorial Optimization
20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings
Häftad, Engelska, 2019
793 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 submissions.
Del 4 - AIRO Springer Series
Mathematical Optimization for Efficient and Robust Energy Networks
Inbunden, Engelska, 2021
1 069 kr
Skickas inom 10-15 vardagar
This book presents a collection of energy production and distribution problems identified by the members of the COST Action TD1207 "Mathematical Optimization in the Decision Support Systems for Efficient and Robust Energy Networks".
Del 4 - AIRO Springer Series
Mathematical Optimization for Efficient and Robust Energy Networks
Häftad, Engelska, 2022
1 069 kr
Skickas inom 10-15 vardagar
This book presents a collection of energy production and distribution problems identified by the members of the COST Action TD1207 "Mathematical Optimization in the Decision Support Systems for Efficient and Robust Energy Networks".
Integer Programming and Combinatorial Optimization
13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings
Häftad, Engelska, 2008
538 kr
Skickas inom 10-15 vardagar
The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26–28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The ?rst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995 [LNCS 920], Vancouver (Canada) 1996 [LNCS 1084], Houston (USA) 1998 [LNCS 1412], Graz (Austria) 1999 [LNCS 1610], Utrecht (The Netherlands) 2001 [LNCS 2081], Boston (USA) 2002 [LNCS 2337], New York (USA) 2004 [LNCS 2986], Berlin (Germany) 2005 [LNCS 3509], and Ithaca (USA) 2007 [LNCS 4168]. The c- ference is not held in the years when the International Symposium of the Ma- ematical Programming Society takes place.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings
Häftad, Engelska, 2010
538 kr
Skickas inom 10-15 vardagar
The 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010) was held in Bologna, Italy, June 16-18, 2010. The conference is intended primarily as a forum to focus on the integration and hybridization of the approaches of constraint programming (CP), arti?cial intelligence (AI), and operations research (OR) technologies for solving lar- scale and complex real-life combinatorial optimization problems. CPAIOR is focused on both theoretical and practical, application-oriented contributions. The interest of the researchcommunity in this conference is witnessed by the highnumber ofhigh-qualitysubmissions receivedthis year,reaching39 long and 33 short papers. From these submissions, we chose 18 long and 17 short papers to be published in full in the proceedings. ThisvolumeincludesextendedabstractsoftheinvitedtalksgivenatCPAIOR.Namely, one by Matteo Fischetti (University of Padova) on cutting planes and their use within search methods; another by Carla Gomes (Cornell University) on the recently funded NSF "Expedition in Computing" grant on the topic of computationalsustainabilityandonthepotentialapplicationofhybridoptimi- tion approachesto this area;a third by Peter Stuckey (University of Melbourne) on the integration of SATis?ability solvers within constraint programming and integer programming solvers.