Open AccessProceedings Article
Using interval graphs in an order processing optimization problem
Isabel Cristina Lopes,J. M. Valério de Carvalho +1 more
- 01 Jan 2010
- pp 1722-1728
TL;DR: In this article, an integer pro- gramming model based on the existence of a perfect elimination scheme in interval graphs is presented, which finds an optimal sequence for the costumers orders.
read more
Abstract: In this paper we address an order pro- cessing optimization problem known as minimization of open stacks (MOSP). We present an integer pro- gramming model, based on the existence of a perfect elimination scheme in interval graphs, which finds an optimal sequence for the costumers orders.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Minimization of Open Orders Using Interval Graphs
Isabel Cristina Lopes,J. M. Valério de Carvalho +1 more
- 01 Nov 2010
TL;DR: In this article, an integer pro-gramming model based on the existence of a perfect elimination order in interval graphs is presented, which finds an optimal sequence for the costumers orders.
The minimization of open stacks problem
Isabel Cristina Lopes
- 01 Jan 2010
TL;DR: An integer programming model based on interval graphs that searches for an appropriate edge completion of the given graph of the problem, while defining a suitable coloring of its vertices is developed.
3
An adaptive genetic algorithm for large-size open stack problems
TL;DR: A genetic approach that combines classical genetic operators (selection, order crossover and pairwise interchange mutation) with an adaptive search strategy, where intensification and diversification phases are obtained by neighbourhood search and by a composite and dynamic fitness function that suitably modifies the search landscape.
References
•Book
Algorithmic graph theory and perfect graphs
Martin Charles Golumbic
- 01 Jan 1980
TL;DR: This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems and remains a stepping stone from which the reader may embark on one of many fascinating research trails.
4.3K
A survey of graph layout problems
TL;DR: A complete view of the current state of the art with respect to layout problems from an algorithmic point of view is presented.
747
On the asymmetric representatives formulation for the vertex coloring problem
TL;DR: In this work, the 0-1 integer programming formulation based on representative vertices is revisited to remove symmetry and new versions of facets derived from substructures of G are presented, including cliques, odd holes and anti-holes and wheels.
133
On a pattern sequencing problem to minimize the maximum number of open stacks
TL;DR: A branch and bound method for solving a wood cutting setting where different panels have to be cut from large boards which uses a greedy type scheme to select the next node to branch.