Najiba Sbihi

According to our database, Najiba Sbihi authored at least 12 papers between 1978 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2016

Scheduling unloading operations in a railway terminal.

Sanae Kouismi, Loubna Benabbou, Najiba Sbihi, Bernard Penz

Proceedings of the 11th International Conference on Intelligent Systems: Theories and Applications, 2016

A discrete time model for storage and scheduling operations in container terminal.

Sanae Kouismi, Loubna Benabbou, Najiba Sbihi

Proceedings of the 3rd International Conference on Logistics Operations Management, 2016

2012

A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem.

Sekoun Kébé, Najiba Sbihi, Bernard Penz

J. Intell. Manuf., 2012

2008

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem.

Ayse Akbalik, Sekoun Kébé, Bernard Penz, Najiba Sbihi

Int. Trans. Oper. Res., 2008

1995

Recognizing bull-free perfect graphs.

Bruce A. Reed, Najiba Sbihi

Graphs Comb., 1995

1990

Two-colourings that decompose perfect graphs.

Vasek Chvátal, William J. Lenhart, Najiba Sbihi

J. Comb. Theory, Ser. B, 1990

1988

Recognizing claw-free perfect graphs.

Vasek Chvátal, Najiba Sbihi

J. Comb. Theory, Ser. B, 1988

1987

Bull-free Berge graphs are perfect.

Vasek Chvátal, Najiba Sbihi

Graphs Comb., 1987

1984

A class of h-perfect graphs.

Najiba Sbihi, J. P. Uhry

Discret. Math., 1984

1980

Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile.

Najiba Sbihi

Discret. Math., 1980

Independence systems with continuous cardinality of bases.

Denis Naddef, Najiba Sbihi, Maurice Tchuenté

Discret. Math., 1980

1978

Etude des stables dans les graphes sans étoile.

Najiba Sbihi

PhD thesis, 1978