A note on solving DiDi's driver-order matching problem

DOI10.1007/s11590-020-01590-3zbMath1460.90154OpenAlexW3029022153MaRDI QIDQ1996745

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

zbMATH Keywords

combinatorial optimizationmixed integer nonlinear programmingsubmodular welfare problemtransportation applications

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Uses Software

• BARON
• KNITRO
• CONOPT
• LINDO
• Bonmin
• Ipopt
• DICOPT
• LINDOGlobal
• PATH Solver
• SBB
• ANTIGONE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithmic framework for convex mixed integer nonlinear programs
• Interfaces to PATH 3.0: Design, implementation and usage
• A convex envelope formula for multilinear functions
• Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
• A hybrid LP/NLP paradigm for global optimization relaxations
• BARON: A general purpose global optimization software package
• Some results on the strength of relaxations of multilinear functions
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Combinatorial auctions with decreasing marginal utilities
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• A threshold of ln n for approximating set cover
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• The global solver in the LINDO API
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• CONOPT—A Large-Scale GRG Code
• The Multilinear Polytope for Acyclic Hypergraphs

This page was built for publication: A note on solving DiDi's driver-order matching problem