Some integer programs arising in the design of main frame computers

DOI10.1007/BF01416008zbMATH Open0776.68014OpenAlexW2076264966MaRDI QIDQ3135915FDOQ3135915

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

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

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)

Cites Work

• Title not available (Why is that?)
• The generalized assignment problem: Valid inequalities and facets
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• (1,k)-configurations and facets for packing problems
• (1,k)-configuration facets for the generalized assignment problem

Cited In (3)

• 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
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional 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)