Some integer programs arising in the design of main frame computers

DOI10.1007/BF01416008MaRDI QIDQ3135915zbMATH OpenOpenAlexFDO

Authors Martin Grötschel, Robert Weismantel, Alexander Martin, Stefan Kiefl, Ludwig Krispenz, Carlos E. Ferreira

Publication date 21 September 1993

Published in ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01416008

zbMATH Keywords

clusteringdesign of the main frame computergraph partitioninghypergraph partitioningmultiple knapsack problem

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Integer programming (90C10) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Recommendations

• Integer programming in VLSI design
• scientific article; zbMATH DE number 1312984
• Some Lessons in Solving Practical Integer Programs
• scientific article; zbMATH DE number 3908168
• Location, scheduling, design and integer programming

Cites work

• (1,k)-configuration facets for the generalized assignment problem
• (1,k)-configurations and facets for packing problems
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• The generalized assignment problem: Valid inequalities and facets

Cited in

(4)

• Problem reduction heuristic for the 0-1 multidimensional knapsack problem
• scientific article; zbMATH DE number 4201579 (Why is no real title available?)
• Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem

This page was built for publication: Some integer programs arising in the design of main frame computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3135915)