Program for stream Combinatorial Optimization

MA-11: Optimization Methods in Transportation Systems
Stream: Combinatorial Optimization
Room: Room 113
Chair(s):

• The Multiple Vehicle Pickup and Delivery Problem with LIFO Constraints
  Enrique Benavent, Mercedes Landete, Ivan Mota, Gregorio Tirado
• New Results for the Directed Profitable Rural Postman Problem
  
• A Large Neighborhood Search based Matheuristic for a Real Life Vehicle Routing Problem
  Simona Mancini
• An Exact Branch-and-Price Algorithm for the Fixed-Charge Transportation Problem
  

MB-11: Advances in Specialized Zero-One Optimization
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Fred Glover, Manuel Laguna, Gary Kochenberger

• GRASP-based Tabu Search for the Vertex p-Center Problem
  
• Convergent Scatter Search and Star Paths with Directional Rounding for 0-1 Mixed Integer Programs
  Saïd Hanafi, Raca Todosijevic, Fred Glover
• The Boolean Quadratic Programming Problem with GUB Constraints
  Yang Wang, Abraham Punnen
• Effective Long-Term Memory Strategies for Local Search-Based Optimization
  

MD-11: Impact of Combinatorial Optimization on Solving Challenging Applications
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Maria Grazia Scutellà

• A Branch and Benders Cut Approach for Nonlinear Location-Design in Green Wireless Local Area Networks
  
• Decomposition Approaches to Assignment and Routing Problems in Home Health Care Services
  
• Network Design under Multi-Source Uncertainty
  Martin Tieves
• The Job-Scheduling and Tool Switching Problem
  Martine Labbé, Daniele Catanzaro, Luís Gouveia

ME-11: Miscellaneous Topics in Combinatorial Optimization
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Michele Monaci

• Self-Splitting Tree Search in a Parallel Environment
  Matteo Fischetti, Michele Monaci, Domenico Salvagnin
• The Split Delivery Vehicle Routing Problem
  Hande Yaman
• On Two-Branch Split Cuts
  
• A Divide-and-Conquer Heuristic for the Minimal Steiner Tree Problem
  Badri Toppur

TA-11: Mixed-Combinatorial Methods in Distance Geometry
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Leo Liberti

• Universal Rigidity of Bar-and-Joint Frameworks and Distance Geometry
  
• Algorithms for Unassigned Distance Geometry Problems Arising in Molecule and Nanoparticle Atomic Structure Determination
  
• The Importance of Atom Orderings in Distance Geometry Applied to Protein Structure Determination
  
• Exact and Approximate Methods for Large Scale Distance Geometry Problems
  Leo Liberti

TB-11: Network Routing
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Michael Juenger

• The Cut Property under Demand Uncertainty
  Sara Mattia
• Single-Commodity Robust Network Design Problem: Complexity, Instances and Heuristic Solutions
  
• Designing Robust Client-Server Networks under Simple Polyhedral Demand Uncertainties
  Daniel Schmidt, Valentina Cacchiani, Michael Juenger, Frauke Liers, Andrea Lodi
• Approximate Earliest Arrival Flows
  

TD-11: Various New Advances in Combinatorial Optimization
Stream: Combinatorial Optimization
Room: Room 113
Chair(s):

• A Very Fast Implementation of the Work Function Algorithm based on Network Flows and Flow Cost Reduction
  
• Schedules for Marketing Products with Negative Externalities
  Xujin Chen, Tirui Cao, Hui Hui Wang
• Method of Pattern Analysis: New Algorithms
  Alexey Myachin
• Vehicle Routing for Solid Waste Collection: A Hybrid Metaheuristic Approach
  Antonio Chaves, Eliseu Araújo

TE-11: Advances in Combinatorial Optimization
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Paolo Toth, Silvano Martello

• The Biobjective Capacitated m-Ring Star Problem
  Herminia I. Calvete, Carmen Galé, Jose A. Iranzo
• A Branch-and-Bound Method for Box Constrained Integer Polynomial Optimization
  Claudia D'Ambrosio, Christoph Buchheim
• Models and Algorithms for Packing into the Smallest Square
  Silvano Martello, Michele Monaci
• Generalized Intersection Cuts from Orthant Interval Sets
  Egon Balas

HA-11: Combinatorial Optimization: Applications
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Jan van Vuuren

• The Application of the Economic Order Quantity and Osmosis Methodologies to Self-Organising Traffic Control
  
• A Multi-Objective Approach towards Terrain-Dependent Facility Location
  Andries Heyns, Jan van Vuuren
• Comparing a Nondominated and a Scalarising Solution Approach for a Nonlinear Combinatorial Multiobjective Optimization Problem given a Limited Budget
  
• On a Scheduling Problem with Sequence-Dependent Setup Times
  

HB-11: Combinatorial Optimization
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Monique Guignard-Spielberg

• A Model for Forest Harvesting and Road Network Design under Uncertainty in Wood Demand and Prices
  
• A Branch&Price Approach for the Vehicle Routing Problem with Intermediate Replenishment Facilities
  Lucas Létocart, Paolo Gianessi, Alberto Ceselli, Roberto Wolfler-Calvo
• Satisfaction Guaranteed
  
• Improving Crossdock Efficiency Through Improved Door Assignment
  Monique Guignard-Spielberg, Peter Hahn, Haohui Zhang

HD-11: Applications of Combinatorial Optimization
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): Stephan Visagie

• Adjusting the Size-Mix of Products During Stock Allocation
  
• SKU Assignment in a Zoned Order Picking System with Unidirectional Picking Lines
  
• A 2D Irregular Levelled Strip Packing Problem: A Case Study
  
• Computing Pairs of Disjoint Paths by Order of Cost
  Marta Pascoal

HE-11: Topics in Linear Programming and Combinatorial Optimization
Stream: Combinatorial Optimization
Room: Room 113
Chair(s):

• Dual-Guided Pivots Rules for Linear Programming
  Jean-Bertrand Gauthier, Jacques Desrosiers, Marco Lübbecke
• The Size Robust Multiple Knapsack Problem
  Denise Tönissen, Marjan van den Akker, Han Hoogeveen
• A Benders Decomposition Approach for the Minimum Weight Maximal Matching Problem
  Z. Caner Taşkın, Tinaz Ekim, Merve Bodur
• Solving Mixed-Integer Programming with Unconstrained Optimization and Hyperbolic Penalty
  

FA-02: Vehicle Routing Problems 1
Stream: Combinatorial Optimization
Room: Room 111
Chair(s): Irene Loiseau

• A Decomposition Approach for the Inventory Routing Problem
  
• A Multi-Depot Vehicle Scheduling Problem in a Public Transportation System in Quito
  Luis Torres, Ramiro Torres
• An Unsupervised Fuzzy Clustering Approach to the Capacitated Vehicle Routing Problem
  

FA-11: Combinatorial Optimization Applications in Industry and Services
Stream: Combinatorial Optimization
Room: Room 113
Chair(s): José Fernando Oliveira

• Coffee Aggregate Production Planning
  
• A Mathematical Programming Approach to Mixed Model Assembly Line Balancing and Sequencing
  
• A Mathematical Railway Model for Allocation of Limited-Stop Service Stations to Minimize Total Travel Time
  Hidetoshi Miura, Toshio Nemoto
• An Agent-based Approach to Schedule Crane Operations in Rail-Rail Transshipment Terminals
  Sam Heshmati, Maria Antónia Carravilla, José Fernando Oliveira

FB-02: Vehicle Routing Problems 2
Stream: Combinatorial Optimization
Room: Room 111
Chair(s): Irene Loiseau

• The Vehicle Routing Problem with Minimizing Environmental Pollution
  
• A Multiple Ant Colony System for the Prize Collecting Location Routing Problem
  
• Outsourcing regional commercial cash operations in the Chinese Banking Industry
  

FB-11: Euclidean Distance Geometry and Applications
Stream: Combinatorial Optimization
Room: Room 113
Chair(s):

• Some Notes of Euclidean Distance Geometry and Graph Theory Involving Telecom, Computer Networks and Molecular Biology Applications
  
• New Developments on the Application of the Hyperbolic Smoothing Technique to Solve the Distance Geometry Problem
  Helder Venceslau, Adilson Elias Xavier
• Numerical Solution of The Euclidean Steiner Tree Problem in n-Space
  
• Molecular Distance Geometry and Atomic Orders