Models and methods for standardization problems

DOI10.1016/j.ejor.2003.10.023zbMath1065.90063OpenAlexW2011014168MaRDI QIDQ704119

Wolfgang Domschke, Bernd Wagner

Publication date: 12 January 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.023

zbMATH Keywords

Combinatorial optimizationQuadratic programmingDiscrete optimizationNetwork flowsStandardization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Location and layout planning. A survey
• On implementing the push-relabel method for the maximum flow problem
• Minimum cuts and related problems
• Costing communication standards in information systems using a minimum cut approach
• A polynomial case of unconstrained zero-one quadratic optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Models and methods for standardization problems