A Combined Trip Generation, Trip Distribution, Modal Split and Traffic Assignment Model

Revised and submitted to Transportation Science February 1985.We introduce a transportation equilibrium model that simultaneously predicts trip generation, trip distribution, modal split, and traffic assignment by algorithms that are guaranteed to converge to an equilibrium and are computationally efficient for large-scale systems. The model is formulated as an equivalent optimization problem, yet it allows realistic, flexible and behaviorally acceptable demand models

Network Flows

Not Availabl

On the Price of Anarchy for flows over time

Dynamic network flows, or network flows over time, constitute an important model for real-world situations where steady states are unusual, such as urban traffic and the Internet. These applications immediately raise the issue of analyzing dynamic network flows from a game-theoretic perspective. In this paper we study dynamic equilibria in the deterministic fluid queuing model in single-source single-sink networks, arguably the most basic model for flows over time. In the last decade we have witnessed significant developments in the theoretical understanding of the model. However, several fundamental questions remain open. One of the most prominent ones concerns the Price of Anarchy, measured as the worst case ratio between the minimum time required to route a given amount of flow from the source to the sink, and the time a dynamic equilibrium takes to perform the same task. Our main result states that if we could reduce the inflow of the network in a dynamic equilibrium, then the Price of Anarchy is exactly e/(e − 1) ≈ 1.582. This significantly extends a result by Bhaskar, Fleischer, and Anshelevich (SODA 2011). Furthermore, our methods allow to determine that the Price of Anarchy in parallel-link networks is exactly 4/3. Finally, we argue that if a certain very natural monotonicity conjecture holds, the Price of Anarchy in the general case is exactly e/(e − 1)

Minimizing the stabbing number of matchings, trees, and triangulations

The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or triangulations of minimum stabbing number for a given set of points. The complexity of these problems has been a long-standing open question; in fact, it is one of the original 30 outstanding open problems in computational geometry on the list by Demaine, Mitchell, and O'Rourke. The answer we provide is negative for a number of minimum stabbing problems by showing them NP-hard by means of a general proof technique. It implies non-trivial lower bounds on the approximability. On the positive side we propose a cut-based integer programming formulation for minimizing the stabbing number of matchings and spanning trees. We obtain lower bounds (in polynomial time) from the corresponding linear programming relaxations, and show that an optimal fractional solution always contains an edge of at least constant weight. This result constitutes a crucial step towards a constant-factor approximation via an iterated rounding scheme. In computational experiments we demonstrate that our approach allows for actually solving problems with up to several hundred points optimally or near-optimally.Comment: 25 pages, 12 figures, Latex. To appear in "Discrete and Computational Geometry". Previous version (extended abstract) appears in SODA 2004, pp. 430-43

Registration of cancer in girls remains lower than expected in countries with low/middle incomes and low female education rates.

BACKGROUND: A decade ago it was reported that childhood cancer incidence was higher in boys than girls in many countries, particularly those with low gross domestic product (GDP) and high infant mortality rate. Research suggests that socio-economic and cultural factors are likely to be responsible. This study aimed to investigate the association between cancer registration rate sex ratios and economic, social and healthcare-related factors using recent data (1998-2002). METHODS: For 62 countries, childhood (0-15 years) cancer registration rate sex ratios were calculated from Cancer Incidence in Five Continents Vol IX, and economic, social and healthcare indicator data were collated. RESULTS: Increased age standardised cancer registration rate sex ratio (M:F) was significantly associated with decreasing life expectancy (P=0.05), physician density (P=0.05), per capita health expenditure (P=0.05), GDP (P=0.01), education sex ratios (primary school enrolment sex ratio (P<0.01); secondary school enrolment sex ratio (P<0.01); adult literacy sex ratio (P<0.01)) and increasing proportion living on less than Int$1 per day (P=0.03). CONCLUSION: The previously described cancer registration sex disparity remains, particularly, in countries with poor health system indicators and low female education rates. We suggest that girls with cancer continue to go undiagnosed and that incidence data, particularly in low- and middle-income countries, should continue to be interpreted with caution

Certificação de produtos orgânicos: obstáculos à implantação de um sistema participativo de garantia na Andaluzia, Espanha.

O trabalho analisa o processo de organização de produtores orgânicos da Andaluzia que estiveram envolvidos em uma tentativa de implantação de um sistema participativo de garantia. Esta iniciativa foi liderada pela administração dessa comunidade autônoma espanhola entre 2006 e 2008. O estudo baseia-se em entrevistas realizadas com atores sociais que estiveram implicados nesse processo, identificando os obstáculos políticos e organizativos que impediram que essa proposta pudesse avançar