Guaranteed-performance of robust algorithms for solving combinatorial optimization problems with imprecise and changing data | Zendy

AI Assistant Blog Pricing

Open Access

Guaranteed-performance of robust algorithms for solving combinatorial optimization problems with imprecise and changing data

Author(s) -

Imed Assayakh,

Imed Kacem,

Giorgio Lucarelli

Publication year - 2022

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - English

Resource type - Conference proceedings

Subject(s) - computer science , mathematical optimization , combinatorial optimization , algorithm , mathematics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.