A note on solving DiDi's driver-order matching problem
DOI10.1007/S11590-020-01590-3zbMATH Open1460.90154OpenAlexW3029022153MaRDI QIDQ1996745FDOQ1996745
Authors: Yanchao Liu 
Publication date: 26 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01590-3
Recommendations
- Dynamic and stochastic rematching for ridesharing systems: formulations and reductions
- A data-driven matching algorithm for ride pooling problem
- An incremental SAT-based approach for solving the real-time taxi-sharing service problem
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
combinatorial optimizationmixed integer nonlinear programmingsubmodular welfare problemtransportation applications
Combinatorial optimization (90C27) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- BARON: A general purpose global optimization software package
- Title not available (Why is that?)
- Interfaces to PATH 3.0: Design, implementation and usage
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The global solver in the LINDO API
- CONOPT—A Large-Scale GRG Code
- Title not available (Why is that?)
- A threshold of ln n for approximating set cover
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Title not available (Why is that?)
- An algorithmic framework for convex mixed integer nonlinear programs
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Title not available (Why is that?)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Combinatorial auctions with decreasing marginal utilities
- Maximizing a monotone submodular function subject to a matroid constraint
- An analysis of approximations for maximizing submodular set functions—I
- A convex envelope formula for multilinear functions
- A hybrid LP/NLP paradigm for global optimization relaxations
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Some results on the strength of relaxations of multilinear functions
- Optimal approximation for the submodular welfare problem in the value oracle model
- The multilinear polytope for acyclic hypergraphs
Cited In (3)
Uses Software
This page was built for publication: A note on solving DiDi's driver-order matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996745)
