Vladimir Marianov

Orcid: 0000-0002-5343-0106

According to our database1, Vladimir Marianov authored at least 59 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sequential customers' decisions in facility location with comparison-shopping.
Comput. Oper. Res., January, 2024

Fifty Years of Location Theory - A Selective Review.
Eur. J. Oper. Res., 2024

Branch-and-price with novel cuts, and a new Stackelberg Security Game.
CoRR, 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
Vehicle routing for milk collection with gradual blending: A case arising in Chile.
Eur. J. Oper. Res., 2022

The leader multipurpose shopping location problem.
Eur. J. Oper. Res., 2022

Product line optimization with multiples sites.
Comput. Oper. Res., 2022

2021
Perspectives on modeling hub location problems.
Eur. J. Oper. Res., 2021

An Integrated Model for Rapid and Slow Transit Network Design (Short Paper).
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
Effects of multipurpose shopping trips on retail store location in a duopoly.
Eur. J. Oper. Res., 2018

Corridor-based metro network design with travel flow capture.
Comput. Oper. Res., 2018

2017
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile.
Comput. Oper. Res., 2017

The milk collection problem with blending and collection points.
Comput. Electron. Agric., 2017

2016
Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries.
Comput. Ind. Eng., 2016

On agglomeration in competitive location models.
Ann. Oper. Res., 2016

Maximizing the minimum cover probability by emergency facilities.
Ann. Oper. Res., 2016

2015
The maximin HAZMAT routing problem.
Eur. J. Oper. Res., 2015

Location modeling for municipal solid waste facilities.
Comput. Oper. Res., 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
Multicriteria decision making under uncertainty: a visual approach.
Int. Trans. Oper. Res., 2014

A bi-objective model for the location of landfills for municipal solid waste.
Eur. J. Oper. Res., 2014

2013
A competitive hub location and pricing problem.
Eur. J. Oper. Res., 2013

p-Hub approach for the optimal park-and-ride facility location problem.
Eur. J. Oper. Res., 2013

Rapid transit network design for optimal cost and origin-destination demand capture.
Comput. Oper. Res., 2013

2012
Optimizing location and size of rural schools in Chile.
Int. Trans. Oper. Res., 2012

Mobile phone tower location for survival after natural disasters.
Eur. J. Oper. Res., 2012

Lagrangean relaxation heuristics for the p-cable-trench problem.
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
Location of single-server immobile facilities subject to a loss constraint.
J. Oper. Res. Soc., 2010

A branch and cut algorithm for the hierarchical network design problem.
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

Minimum cost path location for maximum traffic capture.
Comput. Ind. Eng., 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

A conditional p-hub location problem with attraction functions.
Comput. Oper. Res., 2009

2008
Optimal design of hierarchical networks with free main path extremes.
Oper. Res. Lett., 2008

Facility location for market capture when users rank facilities by shorter travel and waiting times.
Eur. J. Oper. Res., 2008

Selecting compact habitat reserves for species with differential habitat size needs.
Comput. Oper. Res., 2008

Employee positioning and workload allocation.
Comput. Oper. Res., 2008

2007
PoQBA: A New Path Admission Control for Diffserv Networks.
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

Teachers' support with ad-hoc collaborative networks.
J. Comput. Assist. Learn., 2005

Multiple path routing algorithm for IP networks.
Comput. Commun., 2005

Design of Heterogeneous Traffic Networks Using Simulated Annealing Algorithms.
Proceedings of the Information Networking, 2005

2003
Location models for airline hubs behaving as M/D/<i>c</i> queues.
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
Optimal location of public health centres which provide free and paid services.
J. Oper. Res. Soc., 2001

Hierarchical location-allocation models for congested systems.
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
Location of hubs in a competitive environment.
Eur. J. Oper. Res., 1999

1998
Linear, non-approximated models for optimal routing in hazardous environments.
J. Oper. Res. Soc., 1998

1992
The capacitated standard response fire protection siting problem: Deterministic and probabilistic models.
Ann. Oper. Res., 1992


  Loading...