Vladimir Marianov
Orcid: 0000-0002-5343-0106
According to our database1,
Vladimir Marianov
authored at least 59 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Comput. Oper. Res., January, 2024
2023
The follower competitive facility location problem under the nested logit choice rule.
Eur. J. Oper. Res., October, 2023
Store location with multipurpose shopping trips and a new random utility customers' choice model.
Eur. J. Oper. Res., 2023
2022
Eur. J. Oper. Res., 2022
2021
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021
2019
A single allocation <i>p</i>-hub median problem with general piecewise-linear costs in arcs.
Comput. Ind. Eng., 2019
2018
Eur. J. Oper. Res., 2018
Comput. Oper. Res., 2018
2017
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile.
Comput. Oper. Res., 2017
Comput. Electron. Agric., 2017
2016
Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries.
Comput. Ind. Eng., 2016
Ann. Oper. Res., 2016
2015
A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper).
Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015
2014
Int. Trans. Oper. Res., 2014
Eur. J. Oper. Res., 2014
2013
Eur. J. Oper. Res., 2013
Comput. Oper. Res., 2013
2012
Eur. J. Oper. Res., 2012
Comput. Oper. Res., 2012
Transmitter location for maximum coverage and constructive-destructive interference management.
Comput. Oper. Res., 2012
A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty.
Comput. Oper. Res., 2012
2010
J. Oper. Res. Soc., 2010
Eur. J. Oper. Res., 2010
A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows.
Eur. J. Oper. Res., 2010
2009
Optimal location of multi-server congestible facilities operating as <i>M</i>/<i>E</i> <sub><i>r</i></sub>/<i>m</i>/<i>N</i> queues.
J. Oper. Res. Soc., 2009
The heuristic concentration-integer and its application to a class of location problems.
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
2008
Oper. Res. Lett., 2008
Facility location for market capture when users rank facilities by shorter travel and waiting times.
Eur. J. Oper. Res., 2008
Comput. Oper. Res., 2008
2007
Proceedings of the Network-Based Information Systems, First International Conference, 2007
2005
Allocating servers to facilities, when demand is elastic to travel and waiting times.
RAIRO Oper. Res., 2005
A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile.
J. Oper. Res. Soc., 2005
J. Comput. Assist. Learn., 2005
Proceedings of the Information Networking, 2005
2003
Comput. Oper. Res., 2003
Beyond Nintendo: design and assessment of educational video games for first and second grade students.
Comput. Educ., 2003
Location of Multiple-Server Congestible Facilities for Maximizing Expected Demand, when Services are Non-Essential.
Ann. Oper. Res., 2003
2002
Location-Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times.
Ann. Oper. Res., 2002
2001
J. Oper. Res. Soc., 2001
Eur. J. Oper. Res., 2001
2000
Survivable capacitated network design problem: new formulation and Lagrangean relaxation.
J. Oper. Res. Soc., 2000
A probabilistic quality of service constraint for a location model of switches in ATM communications networks.
Ann. Oper. Res., 2000
1999
1998
J. Oper. Res. Soc., 1998
1992
The capacitated standard response fire protection siting problem: Deterministic and probabilistic models.
Ann. Oper. Res., 1992