Reduced cost

In linear programming, reduced cost, or opportunity cost, is the amount by which an objective function coefficient would have to improve (so increase… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1961-2018
05010015019612018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We investigate utilizing the integer programming (IP) technique of reduced cost fixing to improve maximum satisfiability (MaxSAT… (More)
Is this relevant?
Review
2016
Review
2016
The proposition of increased innovation in network applications and reduced cost for network operators has won over the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Flash memory has gained in popularity as storage devices for both enterprise and embedded systems because of its high performance… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
Batteries in a fuel-cell power system are essential to providing the additional power during the sharp load-transients. This… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
Is this relevant?
2008
2008
A wideband photonic instantaneous frequency measurement system is proposed and practically demonstrated. This system employs only… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
In this paper, optimal control theory is used to minimize the total mean drag for a circular cylinder wake flow in the laminar… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
W designing supply chains, firms are often faced with the competing demands of improved customer service and reduced cost. We… (More)
  • figure 1
  • table 2
  • table 1
  • table 3
  • table 4
Is this relevant?
2004
2004
The paper presents a current-source inverter (CSI) topology tailored for large multi-megawatt wind turbine applications. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
In this paper, we propose an effective search procedure that interleaves two steps: subproblem generation and subproblem solution… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this extended abstract, we develop a polynomial time primal network simplex algorithm that runs in O(min(n%n log nC, &n* log n… (More)
Is this relevant?