Results 61 to 70 of about 381 (184)
Wildlife reserve design with connectivity and buffer requirements
Abstract This paper deals with the problem of finding the optimal configuration of a network of land parcels connecting and protecting core areas through corridors and buffer areas within budget. We focus on polynomial‐sized integer linear programming formulations, building on previous research and borrowing some ideas from other authors.
Pedro Ferrão Patrício
wiley +1 more source
Modelling and analysis of nuclear reactor system coupled with a liquid metal battery
Abstract Traditionally, nuclear power plants in the U.S. provide baseload power to the power grid because they have less flexibility for ramping their output power than natural gas peaking plants. However, achieving climate goals to reduce the consumption of fossil‐based natural gas places pressure on nuclear power plants and other power generators to
Amey Shigrekar +4 more
wiley +1 more source
This paper addresses the problem of determining bandwidth allocation and traffic routes in fixed microwave networks such that overall bandwidth cost is minimized while traffic demands are satisfied with a required reliability level.
Mehadji Djamil Abdelhak, Kaddour Mejdi
doaj +1 more source
Multicommodity flows in graphs II
[For part I see Discrete Appl. Math. 6, 55-62 (1983; Zbl 0509.90030).] Let G be a graph with possibly multiple edges and let \((s_ 1,t_ 1)\), \((s_ 2,t_ 2)\), \((s_ 3,t_ 3)\) be pairs of vertices of G. We prove that if for each \(i=1,2,3\), there exist three edge-disjoint paths between \(s_ i\) and \(t_ i\), then there exist edge-disjoint paths \(P_ 1\)
openaire +3 more sources
The strong network orientation problem
Abstract This study presents models and heuristics for solving the strong network orientation problem (SNOP), which can model several tactical optimization problems of setting directions in urban networks. The objective is to set an orientation for each edge in an undirected graph such that the resulting digraph is strongly connected and the total ...
Christophe Duhamel +1 more
wiley +1 more source
Improving an interior-point algorithm for multicommodity flows by quadratic regularizations [PDF]
One of the best approaches for some classes of multicommodity flow problems is a specialized interior-point method that solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient. Its efficiency depends
Castro Pérez, Jordi, Cuesta, Jordi
core +1 more source
In recent years, severe traffic congestion in urban areas has become a growing concern for many cities in China. While beltway expressways have been built to alleviate urban congestion by diverting traffic away from city centers, existing preferential access schemes have led to overuse of certain beltway links and a decline in service levels.
Jimeng Tang +4 more
wiley +1 more source
Given the intricate interactions among the economy, land use, and transportation, it is important to assess the multifaceted impacts of the freight corridor on these systems. This study introduces a land‐use transport interaction (LUTI) modeling approach to quantify the scope and magnitude of the impact of a railway corridor on the distribution of ...
Zongbao Wang +4 more
wiley +1 more source
A Competitive Bilevel Programming Model for Green, CLSCs in Light of Government Incentives
The growth of world population has fueled environmental, legal, and social concerns, making governments and companies attempt to mitigate the environmental and social implications stemming from supply chain operations. The state‐run Environmental Protection Agency has initially offered financial incentives (subsidies) meant to encourage supply chain ...
Arsalan Rahmani +3 more
wiley +1 more source
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
Minimum cost multicommodity flows are a useful model for bandwidth allocation problems. These problems are arising more frequently as regional service providers wish to carry their traffic over some national core network.
Zhang, Lisa +3 more
core +1 more source

