RAIRO - Operations Research Vol. 41 Iss. 01

Home
CJO Mobile
Mobile Device Twinning
Contact Us
Site Map
Help
FAQ
Accessibility
Register

Basket
Log in

User Log-in
Institutional Log-in
Register for an Account

Username or Email Address:

Password:

Remember me

Forgot your Password? Log in

Trouble Logging in?

You can also login through:

Facebook
Twitter
Google Plus

About Us
News
Browse Journals
Authors
- Authors Home
Societies
- Societies Home
Librarians
Agents
- Agents Home
Users
- Users Home
Corporate
- Corporate Home

Citation Search
Quick Search

Advanced Search

Welcome to Cambridge Journals Online

To access subscriptions and personalised features please log in or register

Register for an Account

Journal Information

Editorial Board
RAIRO - Operations Research News
Instructions for Contributors
Transfer of Copyright
Abstracting & Indexing Services
Advertising Information
Impact Factor

RAIRO - Operations Research Home

Save Journal to My CJO Account

Browse Journal

Back Issues

Browse Articles

Forthcoming
Most Downloaded
Most Cited

Submit Your Article
Sign-Up for Contents Alerts

Subscribe & Recommend Journal

Subscribe to Journal

Related Journals

RAIRO - Theoretical Informatics and Applications

Advertising and Corporate Sales

CJO Search Widget What is this?
Add Cambridge Journals Online as a search option in your browser toolbar. What is this?

Access Information

Consortia Access
Free Access
Individual Access
Open Access
Pay-per-View Access
Subscription Access

Home
>
RAIRO - Operations Research
>
Vol. 41 Issue 01

RAIRO - Operations Research

New Content Alerts
CJO Widget About Widget
Rss
Atom

Table of Contents - January 2007 - Volume 41 - Issue 01

View Table of Contents as PDF
Forward TOC

Previous Issue
Next Issue

Select All
Deselect All

View Selected Abstracts
Save to My Saved Articles
Export Citation (s)
Download PDF (s)

Add to Basket

Research Articles

Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity

false

Abstract
Article Structure
Figures and Tables
References

Mohamed Ali Aloulou, Mikhail Y. Kovalyov and Marie-Claude Portmann

RAIRO - Operations Research / Volume 41 / Issue 01 / 2007, pp 1 - 18

© EDP Sciences, ROADEF, SMAI, 2007

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:20070012 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Limited memory solution of bound constrained convex quadratic problems arising in video games Limited memory solution of bound constrained convex quadratic problems arising in video games

false

Abstract
Article Structure
Figures and Tables
References

Michael C. Ferris, Andrew J. Wathen and Paul Armand

RAIRO - Operations Research / Volume 41 / Issue 01 / 2007, pp 19 - 34

© EDP Sciences, ROADEF, SMAI, 2007

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2007009 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand Optimal times of price reductions for an inventory model with partial backorder and vertical shift demand

false

Abstract
Article Structure
Figures and Tables
References

Peng-Sheng You

RAIRO - Operations Research / Volume 41 / Issue 01 / 2007, pp 35 - 47

© EDP Sciences, ROADEF, SMAI, 2007

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2007010 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

A numerical feasible interior point method for linear semidefinite programs A numerical feasible interior point method for linear semidefinite programs

false

Abstract
Article Structure
Figures and Tables
References

Djamel Benterki, Jean-Pierre Crouzeix and Bachir Merikhi

RAIRO - Operations Research / Volume 41 / Issue 01 / 2007, pp 49 - 59

© EDP Sciences, ROADEF, SMAI, 2007

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2007006 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

A discrete-time approximation technique for the time-cost trade-off in PERT networks A discrete-time approximation technique for the time-cost trade-off in PERT networks

false

Abstract
Article Structure
Figures and Tables
References

Amir Azaron, Masatoshi Sakawa, Reza Tavakkoli-Moghaddam and Nima Safaei

RAIRO - Operations Research / Volume 41 / Issue 01 / 2007, pp 61 - 81

© EDP Sciences, ROADEF, SMAI, 2007

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2007005 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Improved approximation of the general soft-capacitated facility location problem Improved approximation of the general soft-capacitated facility location problem

false

Abstract
Article Structure
Figures and Tables
References

Laurent Alfandari

RAIRO - Operations Research / Volume 41 / Issue 01 / 2007, pp 83 - 93

© EDP Sciences, ROADEF, SMAI, 2007

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2007011 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

1.0957-Approximation Algorithm for Random MAX-3SAT 1.0957-Approximation Algorithm for Random MAX-3SAT

false

Abstract
Article Structure
Figures and Tables
References

Wenceslas Fernandez de la Vega and Marek Karpinski

RAIRO - Operations Research / Volume 41 / Issue 01 / 2007, pp 95 - 103

© EDP Sciences, ROADEF, SMAI, 2007

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2007008 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

Convergence analysis of adaptive trust region methods Convergence analysis of adaptive trust region methods

false

Abstract
Article Structure
Figures and Tables
References

Zhen-Jun Shi, Xiang-Sun Zhang and Jie Shen

RAIRO - Operations Research / Volume 41 / Issue 01 / 2007, pp 105 - 121

© EDP Sciences, ROADEF, SMAI, 2007

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2007007 (About DOI)

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Article Rental for 24 Hours
$5.99 / £3.99 / €4.49

View Selected Abstracts
Save to My Saved Articles
Export Citation (s)
Download PDF (s)

Add to Basket

View Table of Contents as PDF
Forward TOC

Previous Issue
Next Issue

Copyright Statement
Rights and Permissions
Privacy Policy
Terms of Use
Feedback
Press Releases

© Cambridge University Press

Powered by:

Cambridge Journals

Cross Ref
Cited by CrossRef
Project Counter
Level Double-A conformance icon, W3C-WAI Web Content Accessibility Guidelines 1.0
RSS Feed
Get Adobe Reader
Automated Content Access Protocol enabled