Saved in:
Bibliographic Details
Main Author: Shioura, Akiyoshi
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2412.06385
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916514562572288
author Shioura, Akiyoshi
author_facet Shioura, Akiyoshi
contents We consider a class of nonlinear integer programming problems arising from re-allocation of dock-capacity in a bike sharing system. The main aim of this note is to derive an improved proximity bound for the problem and its scaled variant. This makes it possible to refine the time bound for the polynomial-time proximity-scaling algorithm by Freund et al. (2022).
format Preprint
id arxiv_https___arxiv_org_abs_2412_06385
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle An Improved Proximity Bound for Bike-Dock Reallocation Problem in Bike Sharing System
Shioura, Akiyoshi
Optimization and Control
We consider a class of nonlinear integer programming problems arising from re-allocation of dock-capacity in a bike sharing system. The main aim of this note is to derive an improved proximity bound for the problem and its scaled variant. This makes it possible to refine the time bound for the polynomial-time proximity-scaling algorithm by Freund et al. (2022).
title An Improved Proximity Bound for Bike-Dock Reallocation Problem in Bike Sharing System
topic Optimization and Control
url https://arxiv.org/abs/2412.06385