Discrete facility location and routing of obnoxious activities-Reference-Cited by-同舟云学术

Discrete facility location and routing of obnoxious activities

Published:2003-11 Issue:1-3 Volume:133 Page:3-28
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Cappanera P.,Gallo G.,Maffioli F.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference24 articles.

1. Dual ascent methods for large-scale multicommodity flow problems;Barnhart;Naval Res. Logist.,1993

2. Models and methods for location and routing decisions relating to hazardous materials;Boffey;Stud. Locational Anal.,1993

3. P. Cappanera, Discrete facility location and routing of obnoxious activities, Ph.D. Thesis, University of Milano, 1999.

4. P. Cappanera, A. Frangioni, Embedding a bundle method in a branch and bound framework: an application-oriented development, Technical Report TR-00-09, Dipartimento di Informatica, Università di Pisa, 2000.

5. P. Cappanera, M. Trubian, A local-search-heuristic for the demand-constrained multidimensional knapsack problem, INFORMS JOC, to appear.

Cited by 99 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Models For The Obnoxious Facility Dispersion Problem;J APPL SCI ENG;2025

2. Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problem;Computers & Operations Research;2024-10

3. Finding and exploring promising search space for The 0–1 Multidimensional Knapsack Problem;Applied Soft Computing;2024-10

4. An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic;European Journal of Operational Research;2024-08

5. Ranking Decomposition for the Discrete Ordered Median Problem;INFORMS Journal on Computing;2024-06-07