Buscar
Mostrando ítems 1-10 de 733
Exact Algorithms for the Vertex Separator Problem in Graphs
(Wiley-blackwellMaldenEUA, 2011)
A branch and cut algorithm for the hierarchical network design problem
(ELSEVIER SCIENCE BV, 2010)
The Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting ...
The application of preprocessing and cutting plane techniques for a class of production planning problems
(Kluwer Academic Publ, 1998-12-01)
This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to ...
A Relax-and-Cut algorithm for the set partitioning problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2008)
The application of preprocessing and cutting plane techniques for a class of production planning problems
(Kluwer Academic Publ, 1998-12-01)
This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to ...
The application of preprocessing and cutting plane techniques for a class of production planning problems
(Kluwer Academic Publ, 2014)