Results 181 to 190 of about 72,629 (308)

An efficient variable neighborhood search approach for the facility location problem with the limited choice rule

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 6, Page 3905-3933, November 2026.
Abstract One of the most common problems in the expansion of a company consists of deciding the most appropriate locations for their facilities. This decision problem, known as the facility location problem, has been studied from different perspectives, considering a number of different constraints.
Enrique García‐Galán   +2 more
wiley   +1 more source

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

open access: yesJournal of Graph Theory, Volume 113, Issue 1, Page 5-18, September 2026.
ABSTRACT A balanced ( p , q )‐coloring of a signed graph ( G , σ ) is an assignment of q colors to each vertex of G from a platter of p colors, such that each color class induces a balanced set (a set that does not induce a negative cycle). The fractional balanced chromatic number of ( G , σ ), denoted χ f b ( G , σ ), is the minimum ratio p / q such ...
Reza Naserasr   +3 more
wiley   +1 more source

All Bermans are not created equal [PDF]

open access: yesAnaesthesia, 2013
T, Salih, H, Scott, A, Hunningher
openaire   +2 more sources

Modelling how age-restricted location policies would impact tobacco retailer density in four US states: California, Connecticut, North Carolina and Ohio. [PDF]

open access: yesTob Control
Craigmile PF   +9 more
europepmc   +1 more source

Sorting Territory: Informal Settlements Recognition and the Production of Political Subjectivities

open access: yesArea, Volume 58, Issue 3, September 2026.
ABSTRACT Informal settlements recognition is an important mechanism through which the state expands its authority and power over place. This legally charged intervention is underscored in this paper as fundamental to the state's territorialising project.
Smith Ouma
wiley   +1 more source

On Oriented Colourings of Graphs on Surfaces

open access: yesJournal of Graph Theory, Volume 112, Issue 4, Page 357-369, August 2026.
ABSTRACT For an oriented graph G, the least number of colours required to oriented colour G is called the oriented chromatic number of G and denoted χ o ( G ). For a non‐negative integer g let χ o ( g ) be the least integer such that χ o ( G ) ≤ χ o ( g ) for every oriented graph G with Euler genus at most g.
Alexander Clow
wiley   +1 more source

Home - About - Disclaimer - Privacy