[PDF] Top 20 Lagrangian-based methods for single and multi-layer multicommodity capacitated network design
Has 10000 "Lagrangian-based methods for single and multi-layer multicommodity capacitated network design" found on our website. Below are the top 20 most common "Lagrangian-based methods for single and multi-layer multicommodity capacitated network design".
Lagrangian-based methods for single and multi-layer multicommodity capacitated network design
... A LAGRANGIAN-BASED MATHEURISTIC FOR MULTILAYER SINGLE FLOW-TYPE MULTICOMMODITY CAPACITATED FIXED-CHARGE NETWORK DESIGN In multilayer network design, ... Voir le document complet
165
Traffic grooming and rerouting in multi-layer WDM network
... The network design problem is thus reduced to the problem of determining the size of the OXC and the size of the EXC at each node of the network in order to satisfy all the traffic ...demands ... Voir le document complet
256
Multicommodity network flows with non convex arc costs
... e for commodity k ...e for commodity k). Solving the Lagrangian dual problem can be a hard task when the number of dual mul- tipliers increases and this has motivated the use of sophisticated ... Voir le document complet
26
The multilayer capacitated survivable IP network design problem: valid inequalities and branch-and-cut
... 1 and a router R 2 , one has to install the same capacity from R 2 to R 1 ...IP layer, so that all the demands can be routed as a multicommodity flow, and this, for any single ... Voir le document complet
8
An exact method for the capacitated single allocation hub location-routing problem
... c L’UNAM Université, Ecole des Mines de Nantes, IRCCyN UMR CNRS 6597, 4 rue Alfred Kastler, B.P. 20722, 44307 Nantes, France- pierre.dejax@mines-nantes.fr d Department of Mathematics and Industrial, Engineering ... Voir le document complet
2
Design of a water allocation and energy network for multi-contaminant problems using multi-objective optimization
... Conclusions and perspectives In this paper, a sequential design methodology for WAHEN has been developed and applied to a large multi-contaminant network considering 5 processes, ... Voir le document complet
19
A new model for the capacitated single allocation hub location-routing problem
... scale and through which flows are to be routed from origins to ...destinations. For an extensive review on the HLP, ones can refer to Alumur & Kara (2008) or Campbell & O’Kelly ...depots, and ... Voir le document complet
10
Design of a water allocation and energy network for multi-contaminant problems using multi-objective optimization
... Wang and Smith, 1994; Bagajewicz et ...Karuppiah and Grossmann, 2006; Alva-Argáez et ...Leewongtanawit and Kim, 2008; Kim et al., 2009; Tudor and Lavric, 2011; Poplewski et ...Ahmetovi´c ... Voir le document complet
18
Capacitated Trees, Capacitated Routing, and Associated Polyhedra
... We study the polyhedral structure of two related core combinatorial problems: the subtree cardinality- constrained minimal spanning tree problem and the identical customer[r] ... Voir le document complet
74
Grammar-Based Decomposition Methods for Multi-Activity Tour Scheduling
... a network flow model, while the second one takes advantage of context-free grammars to obtain a MIP model in which an and/or graph structure is ...model for the MASSP that addresses symmetry issues ... Voir le document complet
153
Multi-criteria p-cycle network design
... proposed for the non- joint protection ...p-cycles, and then select a good sub-set of ...is based only on the topology of the network and is completely independent of the working ... Voir le document complet
7
Augmented Lagrangian and differentiable exact penalty methods
... Augmented Lagrangian methods became quite popular in the early seventies but then yielded ground to algorithms based on Newton's method for solving the system of necessary opti[r] ... Voir le document complet
14
Multi-fidelity Robust Design Optimization Methods for Organic Rankine Cycles
... parameters and d the number of design variables) at the first generation of the multi- objective genetic algorithm (MOGA), in order to generate the BK surrogates, which can be efficiently ... Voir le document complet
285
Convex relaxation methods for graphical models : Lagrangian and maximum entropy approaches
... We propose the maximum entropy relaxation (MER) method, which is the convex optimization problem of selecting the least informative (maximum entropy) model over an [r] ... Voir le document complet
257
Application-Network Cross Layer Multi-variable Cost Function for Application Layer Multicast of Multimedia Delivery over Convergent Networks
... or multi-party multimedia games). Wireless network is a very important part of ...LTE and WiMAX, broadband wireless communication becomes a ...Electrical and Electronics Engineers) ... Voir le document complet
49
Comparison of network inference packages and methods for multiple network inference
... 1] and implemented in simone: the log-likelihood can be penalized by a modified group-LASSO penalty or the empirical covariance matrix can be modified by adding a component depending on all ... Voir le document complet
3
A Bayesian Design Space for analytical methods based on multivariate models and predictions
... models and measurements, it is likely that the CQAs will be within specifications in the future, in the presence of specific input ...identified for the manufacturer to give the required assurance of ... Voir le document complet
36
Hybrid client-server and P2P network for web-based collaborative 3D design
... Up and Castle kit browser with update messages, broadcasting according to the P2P star topology, using a signaling server to es- tablish the communication between two ...rendering and making a better use of ... Voir le document complet
12
Design Methods in the Aerospace Industry: Looking for Evidence of Set-Based Methods
... Targets and Specs Go ...Ward, and Jinkoo ...Parameter Design.” Research in Engineering Design, ...William, and Allen C. Ward. “A Set-Based System for Eliminating ... Voir le document complet
20
A cross-layer design based on geographic information for cooperative wireless networks
... contention based for- warding by default and switch to the recovery process only in case of a local minimum ...routing layer gives the MAC layer the responsibility of han- dling this ... Voir le document complet
6
Sujets connexes