Precoloring co-Meyniel graphs (2007)
Jost, Vincent, Lévêque, Benjamin, Maffray, Frédéric
The pre-coloring extension problem consists, given a graph $G$ and a subset of nodes to which some colors are already assigned, in finding a coloring of $G$ with the minimum number of colors which...
Precoloring co-Meyniel graphs (2007)
Jost, Vincent, Lévêque, Benjamin, Maffray, Frédéric
The pre-coloring extension problem consists, given a graph $G$ and a subset of nodes to which some colors are already assigned, in finding a coloring of $G$ with the minimum number of colors which...
On symmetric Fraenkel's and small deviations conjectures (2006)
Brauner, Nadia, Jost, Vincent, Kubiak, W.
We prove the symmetric Franekel's conjecture, and show that this proof implies the conjecture of Brauner and Crama [2] concerning instances of the maximum deviation just-in-time sequencing with...
On symmetric Fraenkel's and small deviations conjectures (2006)
Brauner, Nadia, Jost, Vincent, Kubiak, W.
We prove the symmetric Franekel's conjecture, and show that this proof implies the conjecture of Brauner and Crama [2] concerning instances of the maximum deviation just-in-time sequencing with...
Comparison of objective functions for the JIT problem (2006)
Lebacque, Vassilissa, Jost, Vincent, Brauner, Nadia
Just-in-time production models have been developed over recent years in order to reduce costs of diversified small-lot production. Those methods aim et matching the exact demand of each product and...
Comparison of objective functions for the JIT problem (2006)
Lebacque, Vassilissa, Jost, Vincent, Brauner, Nadia
Just-in-time production models have been developed over recent years in order to reduce costs of diversified small-lot production. Those methods aim et matching the exact demand of each product and...
Precoloring co-Meyniel graphs (2005)
Jost, Vincent, Lévêque, Benjamin, Maffray, Frédéric
The pre-coloring extension problem consists, given a graph $G$ and a subset of nodes to which some colors are already assigned, in finding a coloring of $G$ with the minimum number of colors which...
Precoloring co-Meyniel graphs (2005)
Jost, Vincent, Lévêque, Benjamin, Maffray, Frédéric
The pre-coloring extension problem consists, given a graph $G$ and a subset of nodes to which some colors are already assigned, in finding a coloring of $G$ with the minimum number of colors which...
Precoloring co-Meyniel graphs (2005)
Jost, Vincent, Lévêque, Benjamin, Maffray, Frédéric
The pre-coloring extension problem consists, given a graph $G$ and a subset of nodes to which some colors are already assigned, in finding a coloring of $G$ with the minimum number of colors which...
Comparison of objective functions for the JIT problem (2004)
Lebacque, Vassilissa, Jost, Vincent, Brauner, Nadia
Just-in-time production models have been developed over recent years in order to reduce costs of diversified small-lot production. Those methods aim et matching the exact demand of each product and...
Comparison of objective functions for the JIT problem (2004)
Lebacque, Vassilissa, Jost, Vincent, Brauner, Nadia
Just-in-time production models have been developed over recent years in order to reduce costs of diversified small-lot production. Those methods aim et matching the exact demand of each product and...
On symmetric Fraenkel's and small deviations conjectures (2002)
Brauner, Nadia, Jost, Vincent, Kubiak, W.
We prove the symmetric Franekel's conjecture, and show that this proof implies the conjecture of Brauner and Crama [2] concerning instances of the maximum deviation just-in-time sequencing with...
On symmetric Fraenkel's and small deviations conjectures (2002)
Brauner, Nadia, Jost, Vincent, Kubiak, W.
We prove the symmetric Franekel's conjecture, and show that this proof implies the conjecture of Brauner and Crama [2] concerning instances of the maximum deviation just-in-time sequencing with...