Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Specific Models, Algorithms, and Software - Monday 3:15 PM – 4:45 PM FABRE Distributed Optimization, Organizer: Franck Iutzeler, session 325 Learning Build J, Z 8 Ground Floor 3x30 min Franck Iutzeler, Distributed Optimization with Sparse Communications and Struc- ture Identification Guanghui Lan, Random gradient extrapo- lation for distributed and stochastic opti- mization Alexander Gasnikov, Distributed Com- putation of Wasserstein Barycenters over Networks Salle 16 Decisions and learning from data, Chair: Christopher McCord, session 481 Learning Build I, Z 7 2nd floor 3x30 min C´edric Rommel, Gaussian mixture penal- ization for trajectory optimization prob- lems Christopher McCord, Optimization over Continuous Decisions with Observational Data Oskar Schneider, Combining Machine Learning and Optimization: Learning to emulate an expert PITRES Facility Layout, Chair: Anders N Gullhav, session 450 Logistics Build O, Z 8 Ground Floor 3x30 min Mirko Dahlbeck, Combinatorial Bounds for the (extended) Double Row Facility Layout Problem Anders Gullhav, A Matheuristic Ap- proach to the Hospital Facility Layout Problem Hanane Khamlichi, A Multi task robot lay- out optimization with inventory lot-sizing problem Salle 23 Combinatorial Optimization in Chip Design, Organizer: Stefan Hougardy, session 257 Scheduling Build G, Z 6 3rd floor 3x30 min Ulrich Brenner, Faster Adder Circuits for Inputs with Prescribed Arrival Times Pascal Cremer, BonnCell: Automatic Cell Layout for 7nm Processors Siad Daboul, Provably Fast and Near- Optimum Gate Sizing Salle DENUCE Progress in Algorithms for Optimal Power Flow Problems I, Organizer: Miguel F Anjos, session 8 Energy Build Q, Z 8 Ground Floor 3x30 min Manuel Ruiz, Solving an Optimal Power Flow (OPF) problem with preventive secu- rity constraints Miguel Anjos, Tight-and-Cheap Conic Re- laxation for the AC Optimal Power Flow Problem Mostafa Sahraei Ardakani, Coordinated Planning and Operation of M-FACTS and Transmission Switching Salle 24 Topics in power systems, Organizer: Alberto J Lamadrid, session 438 Energy Build G, Z 6 3rd floor 3x30 min Giulia De Zotti, Consumers Flexibility Estimation at the TSO Level for Balancing Services Joshua Taylor, Decentralized control of DC-segmented power systems Alberto Lamadrid, Response to Disrup- tions in Electricity with Stochastic Micro- grids Salle LA4 Portfolio Optimization, Chair: Bernardo K. Pagnoncelli, session 393 Sciences Build L, Z 8 Basement 3x30 min Luca Mencarelli, A Multiplicative Weights Update Algorithm for Portfolio Selection Problems Bernardo Pagnoncelli, Regularized port- folio optimization with risk measures Sina Yansori, Log-optimal portfolios un- der random horizon Salle 22 Implementation of interior-point methods for large-scale problems and applications I, Organizer: Jordi Castro, session 353 Algo Build G, Z 6 2nd floor 2x30 min Jose Herskovits, A feasible direction in- terior point algorithm for linear program- ming Stefano Nasini, A specialized interior- point algorithm for very large minimum cost flows in bipa Salle 18 Advances in Linear, Non Linear and Mixed-Integer Optimization, Chair: Hiroshige Dan, session 400 Algo Build I, Z 7 1st floor 3x30 min Erik M¨uhmer, Computational Experi- ments with Nested Dantzig-Wolfe Decom- positions Xavier Schepler, Restrict-and-fix: a con- structive heuristic for mixed-integer pro- grams Hiroshige Dan, Automatic Differentiation Software for Indexed Optimization Prob- lems Room Discrete Optimization & Integer Programming - Monday 5:00 PM – 6:30 PM Salle 34 Lattice methods in Integer Optimisation, Organizer: Iskander Aliev, session 78 IPtheory Build B, Z 3 1st floor 3x30 min Gennadiy Averkov, Approximation of cor- ner polyhedra with intersection cuts Timm Oertel, The Support of Integer Opti- mal Solutions Iskander Aliev, Distances to Lattice Points in Knapsack Polyhedra Salle 44 Data Mining, Chair: Marcus V Poggi, session 504 IPpractice Build C, Z 1 3rd floor 4x20 min Takahiro Kan, A weighting local search for huge assignment problems in item rec- ommendation Atsushi Miyauchi, Exact Clustering via In- teger Programming and Maximum Satisfi- ability Dennis Kreber, The best subset selection problem in regression Marcus Poggi, Cut and Column Genera- tion for Process Discovery Salle 36 IP Practice II, Chair: Petra M. Bartmeyer, session 508 IPpractice Build B, Z 4 Intermediate 4x20 min Ga¨el Guillot, Application of the SSSDP method to combinatorial optimisation problems Yi-Shuai Niu, A Parallel Branch and Bound with DC Algorithm for Mixed In- teger Optimization Quentin Viaud, Two-dimensional bin packing problem with defects on bins Petra Bartmeyer, A new approach to re- lax the binary variables on binary quadratic problems DURKHEIM Mixed-Integer Conic Optimization, Organizer: Sven Wiese, session 57 MINLP Build A, Z 1 3rd floor 3x30 min Lucas Letocart, Exact methods based on SDP for the k-item quadratic knapsack problem Tristan Gally, Knapsack Constraints over the Positive Semidefinite Cone Sven Wiese, The Mixed-integer Conic Op- timizer in MOSEK Salle 39 Polynomial optimization in binary variables, Organizer: Elisabeth Rodriguez-Heck, session 58 MINLP Build E, Z 1 3rd floor 3x30 min Arnaud Lazare, Unconstrained 0-1 polynomial optimization through convex quadratic reformulation Anja Fischer, A study of specially struc- tured polynomial matroid optimization problems Elisabeth Rodriguez-Heck, Linear and quadratic reformulations of nonlinear 0-1 optimization problems Salle 35 MINLP methods in gas transport optimization (II), Organizer: Lars Schewe, session 163 MINLP Build B, Z 4 Intermediate 3x30 min Benjamin Hiller, Exploiting acyclic orien- tations to solve nonlinear potential-based flow problems Kai Becker, ASTS-Orientations on Undi- rected Graphs - A tool for optimizing net- work flows Johannes Th¨urauf, Robust Optimal Dis- crete Arc Sizing for Tree-Shaped Potential Networks LEYTEIRE Scheduling and File Migration, Chair: Asaf Levin, session 345 APPROX Build E, Z 1 3rd floor 3x30 min Liliana Grigoriu, Scheduling on Uniform Nonsimultaneous Parallel Machines Marcin Bienkowski, On phase-based algo- rithms for online file migration Asaf Levin, A unified framework for de- signing EPTAS’s for load balancing on parallel machine Salle 43 Algorithms for matching markets, Organizer: Amin Saberi, session 467 APPROX Build C, Z 1 3rd floor 4x20 min Arash Asadpour, Concise Bidding Through Dependent Randomized Round- ing Balasubraman Sivan, Robust Repeated Auctions under Heterogeneous Buyer Be- havior Vahab Mirrokni, Proportional Allocation: Simple, Distributed, and Diverse Matching w High Entropy Amin Saberi, Matching in dynamic envi- ronments SIGALAS Combinatorial optimization and convexity, Chair: Yu Yokoi, session 424 COMB Build C, Z 2 2nd floor 4x20 min Yuni Iwamasa, Discrete convexity in bi- nary VCSPs Fei Wang, Low matrix completion by a majorized penalty approach Georg Loho, Abstract tropical linear pro- gramming Yu Yokoi, List Supermodular Coloring Salle 41 Practical aspects of network optimization, Chair: Kai Hoppmann, session 427 COMB Build C, Z 1 3rd floor 4x20 min Sonia Vanier, Energy-Efficient in Multi- Hop Wireless Networks Problem Keisuke Hotta, Optimal division for the multi-member constituency system Saman Eskandarzadeh, Maintenance Scheduling in a Railway Corridor Kai Hoppmann, Pushing a Network to its Limits - Finding Maximum Min-Cost- Flows 71 Yüklə 23,3 Mb. Dostları ilə paylaş:
|