Pages that link to "Item:Q1417557"

The following pages link to Discrete facility location and routing of obnoxious activities. (Q1417557):

Displaying 38 items.

• A survey of recent research on location-routing problems (Q296678) (← links)
• A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
• Robust facility location problem for hazardous waste transportation (Q301070) (← links)
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• An exact solution approach for multi-objective location-transportation problem for disaster response (Q336763) (← links)
• A solution method for a two-layer sustainable supply chain distribution model (Q337368) (← links)
• An agent-based framework for modeling and solving location problems (Q610998) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• Hazardous waste management problem: the case for incineration (Q853895) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• Locating landfills--optimization vs. reality (Q864021) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• On the remoteness function in median graphs (Q967439) (← links)
• On the approximation of the minimum disturbance \(p\)-facility location problem (Q1348254) (← links)
• Discrete facility location and routing of obnoxious activities. (Q1417557) (← links)
• Packing two disks in a polygon (Q1614067) (← links)
• Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
• Multiobjective programming for sizing and locating biogas plants: a model and an application in a region of Portugal (Q1652307) (← links)
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← links)
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
• Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty (Q1752865) (← links)
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
• A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation (Q1991221) (← links)
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks (Q2033986) (← links)
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← links)
• Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
• Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network (Q2271121) (← links)
• Computing median and antimedian sets in median graphs (Q2379917) (← links)
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
• A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
• Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• Simultaneous embeddings of graphs as median and antimedian subgraphs (Q3057170) (← links)
• Distribution network design on the battlefield (Q3168957) (← links)
• When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505) (← links)
• A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools (Q6492453) (← links)