Some integer programs arising in the design of main frame computers

DOI10.1007/BF01416008zbMath0776.68014OpenAlexW2076264966MaRDI QIDQ3135915

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

Publication date: 21 September 1993

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 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

clusteringgraph partitioninghypergraph partitioningmultiple knapsack problemdesign of the main frame computer

Mathematics Subject Classification ID

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

Related Items

Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem, Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem

Cites Work

• The generalized assignment problem: Valid inequalities and facets
• (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
• Unnamed Item