Demand allocation with latency cost functions

DOI10.1007/s10107-010-0398-yzbMath1245.90067arXiv0810.1650MaRDI QIDQ2429466

Alessandro Agnetis, Andrea Pacifici, Enrico Grande

Publication date: 27 April 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.1650

zbMATH Keywords

branch and bound; resource allocation; convex functions; latency functions; M.I.N.L.P

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

49M37: Numerical methods based on nonlinear programming

90C27: Combinatorial optimization

Related Items

Approximated perspective relaxations: a project and lift approach, An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem, A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• Covering a line segment with variable radius discs
• Convex programming for disjunctive convex optimization
• Perspective cuts for a class of convex 0-1 mixed integer programs
• How bad is selfish routing?
• Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
• Pricing network edges for heterogeneous selfish users
• Über ein Paradoxon aus der Verkehrsplanung
• Traffic assignment problem for a general network