Applications – OR and Management Sciences

Select, Route and Schedule: Optimizing Community Paramedicine Service Delivery with Mandatory Visits and Patient Prioritization

  • Shima Azizi
  • Brenton Faber
  • Sharon Johnson
  • Renata A. Konrad
  • Andrew C. Trapp
    • Categories Applications - OR and Management Sciences Tags , , , ,

    Healthcare delivery in the United States has been characterized as overly reactive and dependent on emergency department care for safety net coverage, with opportunity for improvement around discharge planning and high readmissions and emergency department bounce-back rates. Community paramedicine is a recent healthcare innovation that enables proactive visitation of patients at home, often shortly after … Read more

    On Recognizing Staircase Compatibility

  • Andreas Bärmann
  • Maximilian Merkert
  • Patrick Gemander
  • Alexander Martin
    • Categories 0-1 Programming, Graphs and Matroids, Scheduling Tags , , ,

    For the problem to find an m-clique in an m-partite graph, staircase compatibility has recently been introduced as a polynomial-time solvable special case. It is a property of a graph together with an m-partition of the vertex set and total orders on each subset of the partition. In optimization problems involving m-cliques in m-partite graphs … Read more

    A Distributionally-Robust Service Center Location Problem with Decision Dependent Demand Induced from a Maximum Attraction Principle

  • Fengqiao Luo
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization, Integer Programming Tags , , , ,

    We establish and analyze a service center location model with a simple but novel decision-dependent demand induced from a maximum attrac- tion principle. The model formulations are investigated in the distributionally- robust optimization framework. A statistical model that is based on the max- imum attraction principle for estimating customer demand and utility gain from service … Read more

    An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems

  • Carina Moreira Costa
  • Dennis Kreber
  • Martin Schmidt
    • Categories (Mixed) Integer Nonlinear Programming, Finance and Economics, Statistics Tags , , , ,

    Cardinality-constrained optimization problems are notoriously hard to solve both in theory and practice. However, as famous examples such as the sparse portfolio optimization and best subset selection problems show, this class is extremely important in real-world applications. In this paper, we apply a penalty alternating direction method to these problems. The key idea is to … Read more

    Capacity requirements and demand management strategies in meal delivery

  • Ramon Auad
  • Alan L. Erera
  • Martin Savelsbergh
    • Categories Applications - OR and Management Sciences Tags , , ,

    Online restaurant aggregators have experienced significant sales growth in recent years, driving demand for meal delivery in the US. Meal delivery logistics is quite challenging, primarily due to the difficulty in managing the supply of delivery resources to satisfy dynamic and uncertain customer demand under very tight time constraints. In this paper, we study several … Read more

    A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem

  • Marije Siemann
  • Matthias Walter
    • Categories Applications - OR and Management Sciences, Polyhedra Tags ,

    We consider the unconstrained traveling tournament problem, a sports timetabling problem that minimizes traveling of teams. Since its introduction about 20 years ago, most research was devoted to modeling and reformulation approaches. In this paper we carry out a polyhedral study for the cubic integer programming formulation by establishing the dimension of the integer hull … Read more

    Cost-Sharing Mechanism Design for Ride-Sharing

  • Maged M. Dessouky
  • Nelson A. Uhan
  • Shichun Hu
  • Phebe Vayanos
    • Categories Game Theory, Transportation

    In this paper, we focus on the cost-sharing problem for ride-sharing that determines how to allocate the total ride cost between the driver and the passengers. We identify the properties that a desirable cost-sharing mechanism should have and develop a general framework which can be used to create specific cost-sharing mechanisms. We propose specific mechanisms … Read more

    Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

  • Ignacio Aravena
  • Steve Chaping
  • Colin Ponce
    • Categories Convex Optimization, Energy, Scheduling Tags , , ,

    We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent … Read more

    Finding the Sequence of Largest Small n-Polygons by Numerical Optimization

  • Ignacio Castillo
  • Frank J. Kampas
  • János Pintér
    • Categories Applications - OR and Management Sciences, Nonlinear Optimization, Optimization Software and Modeling Systems

    LSP(n), the largest small polygon with n vertices, is the polygon of unit diameter that has maximal area A(n). It is known that for all odd values n≥3, LSP(n) is the regular n-polygon; however, this statement is not valid for even values of n. Finding the polygon LSP(n) and A(n) for even values n≥6 has … Read more

    A study of the relation between the single-row and the double-row facility layout problem

  • Mirko Dahlbeck
  • Anja Fischer
  • Philipp Hungerländer
    • Categories (Mixed) Integer Linear Programming, Applications - OR and Management Sciences, Facility Planning and Design Tags , ,

    The NP-hard Multi-Row Facility Layout Problem (MRFLP) consists of a set of one-dimensional departments and pairwise transport weights between them. It asks for a non-overlapping arrangement of the departments along a given number of rows such that the weighted sum of the horizontal center-to-center distances between the departments is minimized. We mainly focus on the … Read more