Given a directed graph with capacities on each arc and given a set of commodities, the QoS constrained Routing Problem (QCRP) consists in routing each commodity while respecting a endto-end upper bound on the delay for each packet. This problem is NP-hard and we propose an augmented Lagrangean approach to solve it. A flow deviation algorithm as well as a projected gradient method are proposed t...

Gauging of space translations for nonrelativistic point particles in one dimension leads to general coordinate transformations with fixed Newtonian time. The minimal gauge invariant extension of the particle velocity requires the introduction of two gauge fields whose minimal self interaction leads to a Maxwellian term in the Lagrangean. No dilaton field is introduced. We fix the gauge such tha...

A number of dynamic models in economics are formulated with forward-looking elements in the constraints – for example, models of risk-sharing with participation constraints and models of optimal policy. Here, standard dynamic programming does not apply. Recent contributions show how to reformulate these models by either rewriting the forward-looking constraints (promised utility approach) or by...

This paper describes a slope scaling heuristic for solving the multicomodity capacitated fixed-charge network design problem. The heuristic integrates a Lagrangean perturbation scheme and intensification/diversification mechanisms based on a long-term memory. Although the impact of the Lagrangean perturbation mechanism on the performance of the method is minor, the intensification/diversificati...

Gauging of space translations for nonrelativistic point particles in one dimension leads to general coordinate transformations with fixed Newtonian time. The minimal gauge invariant extension of the particle velocity requires the introduction of two gauge fields whose minimal self interaction leads to a Maxwellian term in the Lagrangean. No dilaton field is introduced. We fix the gauge such tha...

We consider cost constrained versions of the minimum spanning tree problem and assignment problem. assume edge weights are independent copies a continuous random variable Z that satisfies F ( x ) = P ≤ ≈ α as → 0 , where ≥ 1 . Also, there r O budget constraints with costs chosen from same distribution. use Lagrangean duality to construct polynomial time algorithms produce asymptotically optimal...

We describe two distinct approaches for bosonization in higher dimensions ; one is based on a direct comparison of current correlation functions while the other relies on a Master lagrangean formalism. These are used to bosonize the Massive Thirring Model in three and four dimensions in the weak coupling regime but with an arbitrary fermion mass. In both approaches the explicit bosonized lagran...

Vehicles with multiple compartments are used, among others, for distribution to convenience stores. Based on the convenience stores paradigm we propose optimization models for two possible cargo space layouts and explore their characteristics through computational experiments with randomly generated data sets. In a small real data set an optimal solution of one of the models requires fewer vehi...

This paper addresses the multicommodity capacitated fixed-charge network design problem with nonbifurcated flows and hop constraints. We present and compare mathematical programming formulations for this problem and we study different relaxations: linear programming relaxations, Lagrangean relaxations and partial relaxations of the integrality constraints. In particular, for the hop-indexed for...