Mathematical Programming
Yüklə 23,3 Mb. Pdf görüntüsü
|
Room Discrete Optimization & Integer Programming - Thursday 3:15 PM – 4:45 PM Salle 42 Non-Standard IP Methods, Chair: Ulf Friedrich, session 513 IPtheory Build C, Z 1 3rd floor 3x30 min Tri-Dung Nguyen, Algebraic Geometry and Integer Programmings in Cooperative Game Theory Wolfgang Keller, A hierarchy of cutting plane operators based on lineality spaces Ulf Friedrich, A power series algorithm for non-negative IP Salle 43 Polynomial Time Solvable Problems and Complete Descriptions, Chair: Andreas Bärmann, session 520 IPtheory Build C, Z 1 3rd floor 3x30 min A-E Falq, Extreme points for scheduling around a common due date Lars Rohwedder, On Integer Program- ming and Convolution Andreas B¨armann, The Clique Problem with Multiple-Choice Constraints and Two Polynomial Subcases Salle 44 Computational Issues in Integer Programming, Organizer: Ricardo Fukasawa, session 289 IPpractice Build C, Z 1 3rd floor 3x30 min Laurent Poirrier, Implementation and performance of the simplex method Giulia Zarpellon, Learning MILP resolu- tion outcomes before reaching time-limit Aleksandr Kazachkov, Computational Results with V-Polyhedral Cuts and Strengthening Approaches Salle 39 Convexification and more (I), Organizer: Jon Lee, session 62 MINLP Build E, Z 1 3rd floor 3x30 min Marcia Fampa, Treating indefinite quadratic and bilinear forms in MINLP Am´elie Lambert, Valid inequalities for QCQPs Luze Xu, More Virtuous Smoothing Salle 34 Heuristics in MINLP, Chair: Bertrand Travacca, session 276 MINLP Build B, Z 3 1st floor 3x30 min Jo˜ao Lauro Faco’, MINLP solutions using a Generalized-GRASP solver Christoph Neumann, Feasible rounding ideas for mixed-integer optimization prob- lems Bertrand Travacca, Dual Hopfield Mod- els for Large Scale Mixed Integer Pro- gramming Salle 35 MINLP with quadratic terms, Chair: Enrico Bettiol, session 282 MINLP Build B, Z 4 Intermediate 3x30 min Fabricio Oliveira, The p -Lagrangian method for MIQCQPs Etienne Leclercq, A dedicated version of BiqCrunch for solving the Max-Stable Set problem exactly Enrico Bettiol, Simplicial Decomposition for quadratic convex 0-1 problems LEYTEIRE Approximation Algorithms for Clustering., Organizer: Deeparnab Chakrabarty, session 32 APPROX Build E, Z 1 3rd floor 3x30 min Jaroslaw Byrka, Constant-Factor Approx- imation for Ordered k-Median Amit Jayant Deshpande, Sampling-based algorithms and clustering with outliers Deeparnab Chakrabarty, Generalized Center Problems with Outliers Salle 36 Routing and Inventory, Organizer: Dorit Hochbaum, session 343 APPROX Build B, Z 4 Intermediate 3x30 min Alexander Birx, Improved upper bound for online Dial-a-Ride on the line Jan Marcinkowski, A 4/5 - Approxima- tion Algorithm for the Maximum Traveling Salesman Problem Dorit Hochbaum, The gap between the continuous and discrete Replenishment Schedule problem SIGALAS Algorithms for TSP, Organizer: Ola Svensson, session 239 COMB Build C, Z 2 2nd floor 3x30 min Vera Traub, Approaching 3/2 for the s-t- path TSP Ramamoorthi Ravi, Cut-Covering Decom- positions for Connectivity Problems Ola Svensson, A Constant-factor Approx- imation Algorithm for the Asymmetric Traveling Salesman DURKHEIM Applications of CP, Organizer: Louis-Martin Rousseau, session 284 CP Build A, Z 1 3rd floor 3x30 min Olivier Bachollet, A Constraint Program- ming approach to a meal delivery problem Florian Grenouilleau, A Decomposition Approach for the Home Health Care Rout- ing and Scheduling Problem Louis-Martin Rousseau, A CP Approach to the Traveling Salesman Problem in the Postal Services Room Optimization under Uncertainty - Thursday 3:15 PM – 4:45 PM Salle 32 Theoreticals and practicals aspects of decomposition algorithms for multistage stochastic problems: 1, Organizer: Vincent Leclère, session 246 Stoch Build B, Z 5 Ground Floor 3x30 min David Wozabal, Computing parameter sensitivities for discrete time Markov de- cision processes Nils L¨ohndorf, Modeling time-dependent randomness in stochastic dual dynamic programming Benoˆit Legat, Computing ellipsoidal con- trolled invariant sets for stochastic pro- gramming DENIGES Distributionally Robust Optimization With Marginals and Cones, Organizer: Divya Padmanabhan, session 354 Robust Build C, Z 5 Ground Floor 3x30 min Louis Chen, Distributionally Robust Linear and Discrete Optimization with Marginals Guanglin Xu, A Copositive Approach for Decision Rule Approximations of Multi- Stage RO Divya Padmanabhan, Tractable Solutions to Distributionally Robust Optimisation Salle 37 Non-linear robust optimization, Chair: Laurent Alfandari, session 460 Robust Build B, Z 4 Intermediate 3x30 min Daniel de Roux, Graph learning with the Wasserstein metric Laurent Alfandari, Robust optimization for non-linear impact of data variation Suh-Wen Chiou, A mathematical program for signal control with equilibrium con- straints Salle 30 Generation and Representation Algorithms in Multiobjective Optimization, Organizer: Michael Stiglmayr, session 267 Game Build B, Z 5 Ground Floor 3x30 min Britta Schulze, On a Polynomial Bound in Multiobjective Unconstrained Combina- torial Optimization Kathrin Klamroth, Efficient Representa- tion of the Search Region and Generic Al- gorithms in MOCO Michael Stiglmayr, Representation of the non-dominated set of multiobjective opti- mization problems 89 Yüklə 23,3 Mb. Dostları ilə paylaş:
|