RAIRO - Operations Research Vol. 39 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

RAIRO - Operations Research Home

Save Journal to My CJO Account

Browse Journal

Open Issues
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. 39 Issue 01

RAIRO - Operations Research

New Content Alerts
CJO Widget About Widget
Rss
Atom

Table of Contents - January 2005 - Volume 39 - 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

A mathematical model for an optimal appointed delivery date on a home delivery market A mathematical model for an optimal appointed delivery date on a home delivery market

false

Abstract
Article Structure
Figures and Tables
References

Hidefumi Kawakatsu and Hiroaki Sandoh

RAIRO - Operations Research / Volume 39 / Issue 01 / 2005, pp 3 - 12

© EDP Sciences, 2005

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2005004 (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_US.toc.displayArticle.1000 ??? characters remaining

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

An interior point algorithm for convex quadratic programming with strict equilibrium constraints An interior point algorithm for convex quadratic programming with strict equilibrium constraints

false

Abstract
Article Structure
Figures and Tables
References

Rachid Benouahboun and Abdelatif Mansouri

RAIRO - Operations Research / Volume 39 / Issue 01 / 2005, pp 13 - 33

© EDP Sciences, 2005

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2005002 (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_US.toc.displayArticle.1000 ??? characters remaining

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

Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?

false

Abstract
Article Structure
Figures and Tables
References

Pawoumodom L. Takouda

RAIRO - Operations Research / Volume 39 / Issue 01 / 2005, pp 35 - 54

© EDP Sciences, 2005

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2005003 (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_US.toc.displayArticle.1000 ??? characters remaining

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

About the choice of the variable to unassign in a decision repair algorithm About the choice of the variable to unassign in a decision repair algorithm

false

Abstract
Article Structure
Figures and Tables
References

Cédric Pralet and Gérard Verfaillie

RAIRO - Operations Research / Volume 39 / Issue 01 / 2005, pp 55 - 74

© EDP Sciences, 2005

Published online by Cambridge University Press: 18 March 2011

DOI: http://dx.doi.org/10.1051/ro:2005001 (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_US.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