Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion
From MaRDI portal
Publication:5058005
DOI10.1287/ijoc.2021.1125zbMath1502.90042arXiv1710.05794OpenAlexW2766459328WikidataQ113749948 ScholiaQ113749948MaRDI QIDQ5058005
Amir Ahmadi-Javid, Pooya Hoseinpour
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.05794
optimizationinteger programmingservice system designnetworksqueuescapacity planningstochastic facility location
Convex programming (90C25) Mixed integer programming (90C11) Queues and service in operations research (90B22) Discrete location and assignment (90B80)
Related Items (3)
Robust design of service systems with immobile servers under demand uncertainty ⋮ Equity in genetic newborn screening ⋮ Modeling and solving an economies‐of‐scale service system design problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- Using the \(M/G/1\) queue under processor sharing for exact simulation of queues
- Efficient solution of a class of location-allocation problems with stochastic demand and congestion
- Robust delay-constrained routing in telecommunications
- Analysis of an M/G/\(1\) queue with vacations and multiple phases of operation
- New algorithms for \(k\)-center and extensions
- A review of congestion models in the location of facilities with immobile servers
- Two-term disjunctions on the second-order cone
- Stochastic second-order cone programming in mobile ad hoc networks
- Applications of second-order cone programming
- An exact algorithm for the capacitated facility location problems with single sourcing
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Second-order cone programming
- Solving conic systems via projection and rescaling
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Intersection cuts for convex mixed integer programs from translated cones
- Second order cone programming approach to two-stage network data envelopment analysis
- A queueing approach to a multi class $M / G / 1$ make-to-stock with backlog
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets
- Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application
- Lectures on Modern Convex Optimization
- Perfect simulation of M/G/c queues
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- On the Prevention of Fraud and Privacy Exposure in Process Information Flow
- An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue
- Waiting-Time Distribution of M/DN/1 Queues Through Numerical Laplace Inversion
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Convex Relaxations for Gas Expansion Planning
- Optimal Learning in Linear Regression with Combinatorial Feature Selection
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
- Robust Approximation to Multiperiod Inventory Management
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Location Science
- On Polyhedral Approximations of the Second-Order Cone
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- A route generation algorithm for an optimal fuel routing problem between two single ports
This page was built for publication: Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion
