Hassene Aissi

zbMath Openaissi.hasseneMaRDI QIDQ429649

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the minimum \(s-t\) cut problem with budget constraints Mathematical Programming. Series A. Series B	2024-02-21	Paper
scientific article; zbMATH DE number 7759273 (Why is no real title available?)	2023-11-02	Paper
Vertex downgrading to minimize connectivity Mathematical Programming. Series A. Series B	2023-05-02	Paper
Faster algorithms for next breakpoint and max value for parametric global minimum cuts Integer Programming and Combinatorial Optimization	2022-10-14	Paper
On the linear relaxation of the \(s-t\)-cut problem with budget constraints	2021-02-04	Paper
Randomized contractions for multiobjective minimum cuts	2020-05-27	Paper
Weighted sum model with partial preference information: application to multi-objective optimization European Journal of Operational Research	2018-05-29	Paper
Robust capacity expansion of a network under demand uncertainty: a bi-objective approach Networks	2018-05-11	Paper
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs Mathematical Programming. Series A. Series B	2015-12-09	Paper
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts Integer Programming and Combinatorial Optimization	2014-06-02	Paper
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems Discrete Optimization	2012-06-20	Paper
Minimizing the number of late jobs on a single machine under due date uncertainty Journal of Scheduling	2012-01-16	Paper
Robustness in Multi-criteria Decision Aiding International Series in Operations Research & Management Science	2010-11-22	Paper
Min-max and min-max regret versions of combinatorial optimization problems: A survey European Journal of Operational Research	2009-04-30	Paper
Complexity of the min-max (regret) versions of min cut problems Discrete Optimization	2008-05-16	Paper
Approximating Min-Max (Regret) Versions of Some Polynomial Problems Lecture Notes in Computer Science	2007-09-10	Paper
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) 4OR	2007-05-24	Paper
Approximation of min-max and min-max regret versions of some combinatorial optimization problems European Journal of Operational Research	2007-01-09	Paper
Algorithms and Computation Lecture Notes in Computer Science	2006-11-14	Paper
Algorithms – ESA 2005 Lecture Notes in Computer Science	2006-06-27	Paper
Complexity of the min-max and min-max regret assignment problems Operations Research Letters	2006-02-02	Paper

Research outcomes over time

This page was built for person: Hassene Aissi