The capacitated standard response fire protection siting problem: Deterministic and probabilistic models. - Vladimir Marianov; Charles S. ReVelle (Ann. Oper. Res., 1992)

Linear, non-approximated models for optimal routing in hazardous environments. - Vladimir Marianov; Charles S. Revelle (J. Oper. Res. Soc., 1998)

Location of hubs in a competitive environment. - Vladimir Marianov; Daniel Serra; Charles S. Revelle (Eur. J. Oper. Res., 1999)

A probabilistic quality of service constraint for a location model of switches in ATM communications networks. - Vladimir Marianov; Miguel Rios (Ann. Oper. Res., 2000)

Survivable capacitated network design problem: new formulation and Lagrangean relaxation. - Miguel Rios; Vladimir Marianov; M. Gutierrez (J. Oper. Res. Soc., 2000)

Hierarchical location-allocation models for congested systems. - Vladimir Marianov; Daniel Serra (Eur. J. Oper. Res., 2001)

Optimal location of public health centres which provide free and paid services. - Vladimir Marianov; Paulina Taborga (J. Oper. Res. Soc., 2001)

Location-Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times. - Vladimir Marianov; Daniel Serra (Ann. Oper. Res., 2002)

Location of Multiple-Server Congestible Facilities for Maximizing Expected Demand, when Services are Non-Essential. - Vladimir Marianov (Ann. Oper. Res., 2003)

Beyond Nintendo: design and assessment of educational video games for first and second grade students. - Ricardo Rosas; Miguel Nussbaum; Patricio Cumsille; Vladimir Marianov; Mónica Correa; Patricia Flores; Valeska Grau; Francisca Lagos; Ximena López; Verónica López; Patricio Rodríguez; Marcela Salinas (Comput. Educ., 2003)

Location models for airline hubs behaving as M/D/c queues. - Vladimir Marianov; Daniel Serra (Comput. Oper. Res., 2003)

Design of Heterogeneous Traffic Networks Using Simulated Annealing Algorithms. - Miguel Rios; Vladimir Marianov; Cristian Abaroa (ICOIN, 2005)

Multiple path routing algorithm for IP networks. - Miguel Rios; Vladimir Marianov; Andres Avagliano (Comput. Commun., 2005)

Teachers' support with ad-hoc collaborative networks. - Camila Cortez; Miguel Nussbaum; Ximena López; Patricio Rodríguez; Raúl A. Santelices; Ricardo Rosas; Vladimir Marianov (J. Comput. Assist. Learn., 2005)

A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile. - Vladimir Marianov; F. Fresard (J. Oper. Res. Soc., 2005)

Allocating servers to facilities, when demand is elastic to travel and waiting times. - Vladimir Marianov; Miguel Rios; Francisco Javier Barros (RAIRO Oper. Res., 2005)

PoQBA: A New Path Admission Control for Diffserv Networks. - Enrique Pena; Miguel Rios; Christian Oberli; Vladimir Marianov (NBiS, 2007)

Employee positioning and workload allocation. - Horst A. Eiselt; Vladimir Marianov (Comput. Oper. Res., 2008)

Selecting compact habitat reserves for species with differential habitat size needs. - Vladimir Marianov; Charles S. Revelle; Stephanie A. Snyder (Comput. Oper. Res., 2008)

Facility location for market capture when users rank facilities by shorter travel and waiting times. - Vladimir Marianov; Miguel Rios; Manuel José Icaza (Eur. J. Oper. Res., 2008)

Optimal design of hierarchical networks with free main path extremes. - Carlos Obreque; Vladimir Marianov; Miguel Rios (Oper. Res. Lett., 2008)

A conditional p-hub location problem with attraction functions. - Horst A. Eiselt; Vladimir Marianov (Comput. Oper. Res., 2009)

The heuristic concentration-integer and its application to a class of location problems. - Vladimir Marianov; Michelle Mizumori; Charles S. Revelle (Comput. Oper. Res., 2009)

Optimal location of multi-server congestible facilities operating as M/E r/m/N queues. - Vladimir Marianov; T. Brian Boffey; Roberto D. Galvão (J. Oper. Res. Soc., 2009)

Minimum cost path location for maximum traffic capture. - Gabriel Gutiérrez-Jarpa; Macarena Donoso; Carlos Obreque; Vladimir Marianov (Comput. Ind. Eng., 2010)

A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. - Gabriel Gutiérrez-Jarpa; Guy Desaulniers; Gilbert Laporte; Vladimir Marianov (Eur. J. Oper. Res., 2010)

A branch and cut algorithm for the hierarchical network design problem. - Carlos Obreque; Macarena Donoso; Gabriel Gutiérrez; Vladimir Marianov (Eur. J. Oper. Res., 2010)

Location of single-server immobile facilities subject to a loss constraint. - Brian Boffey; Roberto D. Galvão; Vladimir Marianov (J. Oper. Res. Soc., 2010)

A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty. - Patricio Hernández; Antonio Alonso-Ayuso; Fernanda Bravo; Laureano F. Escudero; Monique Guignard 001; Vladimir Marianov; Andrés Weintraub (Comput. Oper. Res., 2012)

Transmitter location for maximum coverage and constructive-destructive interference management. - Vladimir Marianov; Horst A. Eiselt (Comput. Oper. Res., 2012)

Lagrangean relaxation heuristics for the p-cable-trench problem. - Vladimir Marianov; Gabriel Gutiérrez-Jarpa; Carlos Obreque; Oscar Cornejo (Comput. Oper. Res., 2012)

Mobile phone tower location for survival after natural disasters. - Horst A. Eiselt; Vladimir Marianov (Eur. J. Oper. Res., 2012)

Optimizing location and size of rural schools in Chile. - Fernando Araya; Robert Dell; Pedro Donoso; Vladimir Marianov; Francisco Martínez; Andrés Weintraub (Int. Trans. Oper. Res., 2012)

Rapid transit network design for optimal cost and origin-destination demand capture. - Gabriel Gutiérrez-Jarpa; Carlos Obreque; Gilbert Laporte; Vladimir Marianov (Comput. Oper. Res., 2013)

p-Hub approach for the optimal park-and-ride facility location problem. - Felipe Aros-Vera; Vladimir Marianov; John E. Mitchell 001 (Eur. J. Oper. Res., 2013)

A competitive hub location and pricing problem. - Armin Lüer-Villagra; Vladimir Marianov (Eur. J. Oper. Res., 2013)

A bi-objective model for the location of landfills for municipal solid waste. - Horst A. Eiselt; Vladimir Marianov (Eur. J. Oper. Res., 2014)

Multicriteria decision making under uncertainty: a visual approach. - Horst A. Eiselt; Vladimir Marianov (Int. Trans. Oper. Res., 2014)

A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper). - Gabriel Gutiérrez-Jarpa; Gilbert Laporte; Vladimir Marianov; Luigi Moccia (ATMOS, 2015)

Location modeling for municipal solid waste facilities. - Horst A. Eiselt; Vladimir Marianov (Comput. Oper. Res., 2015)

The maximin HAZMAT routing problem. - Andrés Bronfman; Vladimir Marianov; Germán Paredes-Belmar; Armin Lüer-Villagra (Eur. J. Oper. Res., 2015)

Maximizing the minimum cover probability by emergency facilities. - Zvi Drezner; Vladimir Marianov; George O. Wesolowsky (Ann. Oper. Res., 2016)

On agglomeration in competitive location models. - Vladimir Marianov; Horst A. Eiselt (Ann. Oper. Res., 2016)

Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries. - Guillermo Latorre-Núñez; Armin Lüer-Villagra; Vladimir Marianov; Carlos Obreque; Francisco J. Ramis; Liliana Neriz (Comput. Ind. Eng., 2016)

The milk collection problem with blending and collection points. - Germán Paredes-Belmar; Armin Lüer-Villagra; Vladimir Marianov; Cristián E. Cortés; Andrés Bronfman (Comput. Electron. Agric., 2017)

Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile. - Gabriel Gutiérrez-Jarpa; Gilbert Laporte; Vladimir Marianov; Luigi Moccia (Comput. Oper. Res., 2017)

Corridor-based metro network design with travel flow capture. - Gabriel Gutiérrez-Jarpa; Gilbert Laporte; Vladimir Marianov (Comput. Oper. Res., 2018)

Effects of multipurpose shopping trips on retail store location in a duopoly. - Vladimir Marianov; Horst A. Eiselt; Armin Lüer-Villagra (Eur. J. Oper. Res., 2018)

A single allocation p-hub median problem with general piecewise-linear costs in arcs. - Armin Lüer-Villagra; Horst A. Eiselt; Vladimir Marianov (Comput. Ind. Eng., 2019)

An Integrated Model for Rapid and Slow Transit Network Design (Short Paper). - Natividad González-Blanco; Antonio J. Lozano; Vladimir Marianov; Juan A. Mesa (ATMOS, 2021)

Perspectives on modeling hub location problems. - Sibel A. Alumur; James F. Campbell; Iván A. Contreras; Bahar Yetis Kara; Vladimir Marianov; Morton E. O'Kelly (Eur. J. Oper. Res., 2021)

Product line optimization with multiples sites. - Sebastián Dávila-Gálvez; Martine Labbé; Vladimir Marianov; Fernando Ordóñez; Frédéric Semet (Comput. Oper. Res., 2022)

The leader multipurpose shopping location problem. - Armin Lüer-Villagra; Vladimir Marianov; Horst A. Eiselt; Gonzalo Méndez-Vogel (Eur. J. Oper. Res., 2022)

Vehicle routing for milk collection with gradual blending: A case arising in Chile. - Germán Paredes-Belmar; Elizabeth Montero; Armin Lüer-Villagra; Vladimir Marianov; Claudio Araya-Sassi (Eur. J. Oper. Res., 2022)

Store location with multipurpose shopping trips and a new random utility customers' choice model. - Gonzalo Méndez-Vogel; Vladimir Marianov; Armin Lüer-Villagra; Horst A. Eiselt (Eur. J. Oper. Res., 2023)

The follower competitive facility location problem under the nested logit choice rule. - Gonzalo Méndez-Vogel; Vladimir Marianov; Armin Lüer-Villagra (Eur. J. Oper. Res., 2023)

Branch-and-price with novel cuts, and a new Stackelberg Security Game. - Pamela Bustamante-Faúndez; Víctor Bucarey López; Martine Labbé; Vladimir Marianov; Fernando Ordóñez (CoRR, 2024)

Fifty Years of Location Theory - A Selective Review. - Vladimir Marianov; Horst A. Eiselt (Eur. J. Oper. Res., 2024)

Sequential customers' decisions in facility location with comparison-shopping. - Gonzalo Méndez-Vogel; Vladimir Marianov; Pascual Fernández; Blas Pelegrín; Armin Lüer-Villagra (Comput. Oper. Res., 2024)

Novel valid inequalities and branch-and-price for Stackelberg security games. - Pamela Bustamante-Faúndez; Víctor Bucarey López; Martine Labbé; Vladimir Marianov; Fernando Ordóñez (Comput. Oper. Res., 2025)

A mixed-integer optimization formulation for buyer formation. - Sebastián Dávila-Gálvez; Martine Labbé; Vladimir Marianov; Fernando Ordóñez; Frédéric Semet (Comput. Oper. Res., 2025)