Sciweavers

2636 search results - page 421 / 528
» Linear Programming
Sort
View
TSP
2008
166views more  TSP 2008»
14 years 9 months ago
A Convex Analysis Framework for Blind Separation of Non-Negative Sources
This paper presents a new framework for blind source separation (BSS) of non-negative source signals. The proposed framework, referred herein to as convex analysis of mixtures of ...
Tsung-Han Chan, Wing-Kin Ma, Chong-Yung Chi, Yue W...
JSAC
2007
121views more  JSAC 2007»
14 years 9 months ago
Spare Capacity Allocation in Two-Layer Networks
Abstract— In this paper we consider the problem of provisioning spare capacity in two-layer backbone networks using shared backup path protection. First, two spare capacity alloc...
Yu Liu, David Tipper, K. Vajanapoom
EOR
2000
98views more  EOR 2000»
14 years 9 months ago
Optimal planning in large multi-site production networks
This contribution describes a general mixed-integer linear programming model based on a time-indexed formulation covering the relevant features required for the complete supply ch...
Christian Timpe, Josef Kallrath
INFORMS
2000
54views more  INFORMS 2000»
14 years 9 months ago
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
EOR
2002
89views more  EOR 2002»
14 years 9 months ago
Analytic centers and repelling inequalities
ct 9 The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling 10 path is a generalization of the analytic central path fo...
Richard J. Caron, Harvey J. Greenberg, Allen G. Ho...