Mixed integer formulations for a routing problem with information collection in wireless networks

DOI10.1016/j.ejor.2019.06.054zbMath1430.90163OpenAlexW2961512724MaRDI QIDQ2273919

Agostinho Agra, Eladio Ocaña, Luis Flores-Luyo, Rosa M. V. Figueiredo

Publication date: 18 September 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.06.054

zbMATH Keywords

mixed integer programmingroutingwireless networks

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (4)

On the effect of using sensors and dynamic forecasts in inventory-routing problems ⋮ Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls ⋮ A faster algorithm for determining the linear feasibility of systems of BTVPI constraints ⋮ Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compact formulations of the Steiner traveling salesman problem and related problems
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• Discrete time and continuous time formulations for a short sea inventory routing problem
• A maritime inventory routing problem: Discrete time formulations and valid inequalities
• Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• The prize collecting traveling salesman problem

This page was built for publication: Mixed integer formulations for a routing problem with information collection in wireless networks