Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

ORL
1998

favoriteEmaildiscussreport

137views more ORL 1998»

Calculation of stability radii for combinatorial optimization problems

13 years 10 months ago

Calculation of stability radii for combinatorial optimization problems

Download www.tinbergen.nl

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results to the tolerance approach to sensitivity analysis.

Nilotpal Chakravarti, Albert P. M. Wagelmans

Real-time Traffic

Binary Programming Problems | Min Sum | ORL 1998 | Stability Radius |

claim paper

Related Content

» Optimal Robust Stabilization and Dissipativity Synthesis by Behavioral Interconnection

» Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations

» Improving clustering stability with combinatorial MRFs

» Optimal mistuning for improved stability of vehicular platoons

» RealTime ZMP Compensation Method using Null Motion for Mobile Manipulators

» Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks

» Achieving symmetric Pareto Nash equilibria using biased replicator dynamics

» Optimal controller tuning for nonlinear processes

» A Matching Scheme to Enhance Performance Evaluation of RastertoVector Conversion Algorithm...

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	ORL
Authors	Nilotpal Chakravarti, Albert P. M. Wagelmans

Comments (0)