Search Results - subject:"Covering problems"

Did you mean: subject:"Covering problem" (833 results)

Statistical-machine-learning-based intelligent relaxation for set-covering location models to identify locations of charging stations for electric vehicles

Özşahin, Selcen Gülsüm Aslan; Erdebilli, Babek - In: EURO journal on transportation and logistics 12 (2023), pp. 1-10

Europe strengthens its policies on climate change, green transition, and sustainable energy by addressing the high greenhouse-gas emissions in the transportation sector. Europe aims to reduce such emissions and reach a state of carbon neutrality by 2030 and 2050, respectively. This is feasible...

Persistent link: https://www.econbiz.de/10014518072

The power of adaptivity for stochastic submodular cover

Ghuge, Rohan; Gupta, Anupam; Nagarajan, Viswanath - In: Operations research 72 (2024) 3, pp. 1156-1176

Persistent link: https://www.econbiz.de/10014557556

Mixed-integer programming approaches for the time-constrained maximal covering routing problem

Sinnl, Markus - In: OR spectrum : quantitative approaches in management 43 (2021) 2, pp. 497-542

Persistent link: https://www.econbiz.de/10012585041

Upgrading edges in the maximal covering location problem

Baldomero-Naranjo, Marta; Kalcsics, Jörg; Marín, Alfredo - In: European journal of operational research : EJOR 303 (2022) 1, pp. 14-36

Persistent link: https://www.econbiz.de/10013363866

Exact algorithms for budgeted prize-collecting covering subgraph problems

Morandi, N.; Leus, Roel; Yaman, H. - In: Computers & operations research : and their … 144 (2022), pp. 1-11

Persistent link: https://www.econbiz.de/10013264814

Allocating costs in set covering problems

Bergantiños, Gustavo; Gómez-Rúa, María; Llorca, … - In: European journal of operational research : EJOR 284 (2020) 3, pp. 1074-1087

Persistent link: https://www.econbiz.de/10012238939

A branch-and-cut algorithm for the maximum covering cycle problem

Álvarez-Miranda, Eduardo; Sinnl, Markus - In: Decomposition methods for hard optimization problems, (pp. 487-499). 2020

Persistent link: https://www.econbiz.de/10012157107

Exact approaches for solving a covering problem with capacitated subtrees

Clautiaux, François; Guillot, Jérémy; Pesneau, Pierre - In: Computers & operations research : and their … 105 (2019), pp. 85-101

Persistent link: https://www.econbiz.de/10011997064

On the cores of games arising from integer edge covering functions of graphs

Park, Boram; Kim, Suh-ryung; Kim, Hye Kyung - In: Journal of combinatorial optimization 26 (2013) 4, pp. 786-798

Persistent link: https://www.econbiz.de/10010205263

A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances

López-de-los-Mozos, M. C.; Mesa, Juan A.; Schöbel, Anita - In: European journal of operational research : EJOR 260 (2017) 1, pp. 108-121

Persistent link: https://www.econbiz.de/10011697651