نتایج جستجو برای: lagrangian relaxation

تعداد نتایج: 98703  

1999
Cheng-Shong WU Shi-Wei LEE

In this paper, we consider the working VP and backup VP routing problems jointly and employ the integer programming based approach to maximize the system resource utilization and the network survivability. The VP planning problem is formulated as a nonlinear combinatorial optimization problem. The objective function minimizes the resource usage while maximizing the network survivability. By pro...

2006
Vo Ngoc Dieu Weerakorn Ongsakul

This paper proposes an augmented Lagrangian Hopfield network (ALHN) for combined heat and power economic dispatch (CHPED) problem. The ALHN is the continuous Hopfield neural network based on augmented Lagrangian relaxation as its energy function. In the proposed ALHN, its energy function is augmented by Hopfield terms from Hopfield neural network and penalty factors from augmented Lagrangian re...

1994
Y. Narahari Sundar Ram Vedula

In this article, we develop three e f lc ient extensions t o a recent production scheduling algorithm based on Lagrangian relaxation [9]. These extensions handle the following real-world features: 0 stochastic availability of raw material, 0 reworking and scrapping of parts , and 0 incorporating set-up costs and set-up t imes in the Scheduling of multiclass manufacturing sys tems The f irs t t ...

2016
Agostinho Agra Adelaide Cerveira Cristina Requejo

We consider a single item Production-Inventory-Routing problem with a single producer/supplier and multiple retailers. Inventory management constraints are considered both at the producer and at the retailers, following a vendor managed inventory approach, where the supplier monitors the inventory at retailers and decides on the replenishment policy for each retailer. We assume a constant produ...

2012
Jun Harashima Sadao Kurohashi

Sentence compression is important in a wide range of applications in natural language processing. Previous approaches of Japanese sentence compression can be divided into two groups. Word-based methods extract a subset of words from a sentence to shorten it, while bunsetsubased methods extract a subset of bunsetsu (where a bunsetsu is a text unit that consists of content words and following fun...

Journal: :Computers & Chemical Engineering 2014
Brage Rugstad Knudsen Ignacio E. Grossmann Bjarne A. Foss Andrew R. Conn

Suppressing the effects of liquid loading is a key issue for efficient utilization of mid and late-life wells in shale-gas systems. This state of the wells can be prevented by performing short shut-ins when the gas rate falls below the minimum rate needed to avoid liquid loading. In this paper, we present a Lagrangian relaxation based scheme for shut-in scheduling of distributed shale multiwell...

Journal: :European Journal of Operational Research 2009
Boris Detienne Laurent Péridy Eric Pinson David Rivreau

Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and generated instances are reported.

Journal: :Transactions of the Japanese Society for Artificial Intelligence 2011

2004

Simultaneous gate sizing with multiple Vt assignment for optimal delay and power is a complicated task in modern custom designs. In this work, we make the key contribution of a novel gate-sizing and multi-Vt assignment technique based on generalized Lagrangian Relaxation. Experimental results show that our technique has linear runtime and memory usage, and can optimally tune circuits with over ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید