default search action
Vladimir Marianov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j54]Gonzalo Méndez-Vogel
, Vladimir Marianov, Pascual Fernández
Sequential customers' decisions in facility location with comparison-shopping. Comput. Oper. Res. 161: 106448 (2024) - [j53]Vladimir Marianov
Fifty Years of Location Theory - A Selective Review. Eur. J. Oper. Res. 318(3): 701-718 (2024) - [i1]Pamela Bustamante-Faúndez, Víctor Bucarey López, Martine Labbé, Vladimir Marianov, Fernando Ordóñez:
Branch-and-price with novel cuts, and a new Stackelberg Security Game. CoRR abs/2405.09356 (2024) - 2023
- [j52]Gonzalo Méndez-Vogel
Store location with multipurpose shopping trips and a new random utility customers' choice model. Eur. J. Oper. Res. 305(2): 708-721 (2023) - [j51]Gonzalo Méndez-Vogel
The follower competitive facility location problem under the nested logit choice rule. Eur. J. Oper. Res. 310(2): 834-846 (2023) - 2022
- [j50]Sebastián Dávila-Gálvez
Product line optimization with multiples sites. Comput. Oper. Res. 148: 105978 (2022) - [j49]Armin Lüer-Villagra
The leader multipurpose shopping location problem. Eur. J. Oper. Res. 302(2): 470-481 (2022) - [j48]Germán Paredes-Belmar
Vehicle routing for milk collection with gradual blending: A case arising in Chile. Eur. J. Oper. Res. 303(3): 1403-1416 (2022) - 2021
- [j47]Sibel A. Alumur
Perspectives on modeling hub location problems. Eur. J. Oper. Res. 291(1): 1-17 (2021) - [c4]Natividad González-Blanco
An Integrated Model for Rapid and Slow Transit Network Design (Short Paper). ATMOS 2021: 18:1-18:6
2010 – 2019
- 2019
- [j46]Armin Lüer-Villagra, Horst A. Eiselt, Vladimir Marianov
A single allocation p-hub median problem with general piecewise-linear costs in arcs. Comput. Ind. Eng. 128: 477-491 (2019) - 2018
- [j45]Gabriel Gutiérrez-Jarpa
Corridor-based metro network design with travel flow capture. Comput. Oper. Res. 89: 58-67 (2018) - [j44]Vladimir Marianov
Effects of multipurpose shopping trips on retail store location in a duopoly. Eur. J. Oper. Res. 269(2): 782-792 (2018) - 2017
- [j43]Germán Paredes-Belmar
The milk collection problem with blending and collection points. Comput. Electron. Agric. 134: 109-123 (2017) - [j42]Gabriel Gutiérrez-Jarpa
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile. Comput. Oper. Res. 78: 27-43 (2017) - 2016
- [j41]Vladimir Marianov
On agglomeration in competitive location models. Ann. Oper. Res. 246(1-2): 31-55 (2016) - [j40]Zvi Drezner, Vladimir Marianov
Maximizing the minimum cover probability by emergency facilities. Ann. Oper. Res. 246(1-2): 349-362 (2016) - [j39]Guillermo Latorre-Núñez
Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries. Comput. Ind. Eng. 97: 248-257 (2016) - 2015
- [j38]Horst A. Eiselt, Vladimir Marianov
Location modeling for municipal solid waste facilities. Comput. Oper. Res. 62: 305-315 (2015) - [j37]Andrés Bronfman
The maximin HAZMAT routing problem. Eur. J. Oper. Res. 241(1): 15-27 (2015) - [c3]Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia:
A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper). ATMOS 2015: 95-96 - 2014
- [j36]Horst A. Eiselt, Vladimir Marianov
A bi-objective model for the location of landfills for municipal solid waste. Eur. J. Oper. Res. 235(1): 187-194 (2014) - [j35]Horst A. Eiselt, Vladimir Marianov
Multicriteria decision making under uncertainty: a visual approach. Int. Trans. Oper. Res. 21(4): 525-540 (2014) - 2013
- [j34]Gabriel Gutiérrez-Jarpa
Rapid transit network design for optimal cost and origin-destination demand capture. Comput. Oper. Res. 40(12): 3000-3009 (2013) - [j33]Felipe Aros-Vera, Vladimir Marianov
p-Hub approach for the optimal park-and-ride facility location problem. Eur. J. Oper. Res. 226(2): 277-285 (2013) - [j32]Armin Lüer-Villagra
A competitive hub location and pricing problem. Eur. J. Oper. Res. 231(3): 734-744 (2013) - 2012
- [j31]Vladimir Marianov
Lagrangean relaxation heuristics for the p-cable-trench problem. Comput. Oper. Res. 39(3): 620-628 (2012) - [j30]Vladimir Marianov
Transmitter location for maximum coverage and constructive-destructive interference management. Comput. Oper. Res. 39(7): 1441-1449 (2012) - [j29]Patricio Hernández, Antonio Alonso-Ayuso
A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty. Comput. Oper. Res. 39(9): 2232-2241 (2012) - [j28]Horst A. Eiselt, Vladimir Marianov
Mobile phone tower location for survival after natural disasters. Eur. J. Oper. Res. 216(3): 563-572 (2012) - [j27]Fernando Araya, Robert Dell, Pedro Donoso, Vladimir Marianov
Optimizing location and size of rural schools in Chile. Int. Trans. Oper. Res. 19(5): 695-710 (2012) - 2010
- [j26]Gabriel Gutiérrez-Jarpa
Minimum cost path location for maximum traffic capture. Comput. Ind. Eng. 58(2): 332-341 (2010) - [j25]Carlos Obreque
A branch and cut algorithm for the hierarchical network design problem. Eur. J. Oper. Res. 200(1): 28-35 (2010) - [j24]Gabriel Gutiérrez-Jarpa
A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. Eur. J. Oper. Res. 206(2): 341-349 (2010) - [j23]Brian Boffey, Roberto D. Galvão, Vladimir Marianov
Location of single-server immobile facilities subject to a loss constraint. J. Oper. Res. Soc. 61(6): 987-999 (2010)
2000 – 2009
- 2009
- [j22]Vladimir Marianov
The heuristic concentration-integer and its application to a class of location problems. Comput. Oper. Res. 36(5): 1406-1422 (2009) - [j21]Horst A. Eiselt, Vladimir Marianov
A conditional p-hub location problem with attraction functions. Comput. Oper. Res. 36(12): 3128-3135 (2009) - [j20]Vladimir Marianov
Optimal location of multi-server congestible facilities operating as M/E r/m/N queues. J. Oper. Res. Soc. 60(5): 674-684 (2009) - 2008
- [j19]Vladimir Marianov
Selecting compact habitat reserves for species with differential habitat size needs. Comput. Oper. Res. 35(2): 475-487 (2008) - [j18]Horst A. Eiselt, Vladimir Marianov
Employee positioning and workload allocation. Comput. Oper. Res. 35(2): 513-524 (2008) - [j17]Vladimir Marianov
Facility location for market capture when users rank facilities by shorter travel and waiting times. Eur. J. Oper. Res. 191(1): 32-44 (2008) - [j16]Carlos Obreque
Optimal design of hierarchical networks with free main path extremes. Oper. Res. Lett. 36(3): 366-371 (2008) - 2007
- [c2]Enrique Pena, Miguel Rios, Christian Oberli, Vladimir Marianov
PoQBA: A New Path Admission Control for Diffserv Networks. NBiS 2007: 435-445 - 2005
- [j15]Miguel Rios, Vladimir Marianov
Multiple path routing algorithm for IP networks. Comput. Commun. 28(7): 829-836 (2005) - [j14]Camila Cortez, Miguel Nussbaum
Teachers' support with ad-hoc collaborative networks. J. Comput. Assist. Learn. 21(3): 171-180 (2005) - [j13]Vladimir Marianov
A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile. J. Oper. Res. Soc. 56(3): 244-251 (2005) - [j12]Vladimir Marianov
Allocating servers to facilities, when demand is elastic to travel and waiting times. RAIRO Oper. Res. 39(3): 143-162 (2005) - [c1]Miguel Rios, Vladimir Marianov
Design of Heterogeneous Traffic Networks Using Simulated Annealing Algorithms. ICOIN 2005: 520-530 - 2003
- [j11]Vladimir Marianov
Location of Multiple-Server Congestible Facilities for Maximizing Expected Demand, when Services are Non-Essential. Ann. Oper. Res. 123(1-4): 125-141 (2003) - [j10]Ricardo Rosas, Miguel Nussbaum
Beyond Nintendo: design and assessment of educational video games for first and second grade students. Comput. Educ. 40(1): 71-94 (2003) - [j9]Vladimir Marianov
Location models for airline hubs behaving as M/D/c queues. Comput. Oper. Res. 30(7): 983-1003 (2003) - 2002
- [j8]Vladimir Marianov
Location-Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times. Ann. Oper. Res. 111(1-4): 35-50 (2002) - 2001
- [j7]Vladimir Marianov
Hierarchical location-allocation models for congested systems. Eur. J. Oper. Res. 135(1): 195-208 (2001) - [j6]Vladimir Marianov, Paulina Taborga:
Optimal location of public health centres which provide free and paid services. J. Oper. Res. Soc. 52(4): 391-400 (2001) - 2000
- [j5]Vladimir Marianov, Miguel Rios:
A probabilistic quality of service constraint for a location model of switches in ATM communications networks. Ann. Oper. Res. 96(1-4): 237-243 (2000) - [j4]Miguel Rios, Vladimir Marianov
Survivable capacitated network design problem: new formulation and Lagrangean relaxation. J. Oper. Res. Soc. 51(5): 574-582 (2000)
1990 – 1999
- 1999
- [j3]Vladimir Marianov
Location of hubs in a competitive environment. Eur. J. Oper. Res. 114(2): 363-371 (1999) - 1998
- [j2]Vladimir Marianov
Linear, non-approximated models for optimal routing in hazardous environments. J. Oper. Res. Soc. 49(2): 157-164 (1998) - 1992
- [j1]Vladimir Marianov
The capacitated standard response fire protection siting problem: Deterministic and probabilistic models. Ann. Oper. Res. 40(1): 303-322 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: