Branch and bound method for multiobjective pairing selection

DOI10.1016/j.automatica.2010.02.014zbMath1191.93038OpenAlexW2068341210MaRDI QIDQ980932

Yi Cao, Vinay Kariwala

Publication date: 8 July 2010

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: http://dspace.lib.cranfield.ac.uk/handle/1826/5060

zbMATH Keywords

global optimizationdecentralized controllarge-scale systemsstructured singular valuerelative gain arraycomputer-aided control system designmultiobjective optimizations

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Design techniques (robust design, computer-aided design, etc.) (93B51) Decentralized systems (93A14) Large-scale systems (93A15)

Related Items

A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Branch and bound method for multiobjective pairing selection

Uses Software

• Matlab
• B3muRGA

Cites Work

• Survey of multi-objective optimization methods for engineering
• Cross-directional control of sheet and film processes
• Branch and bound method for multiobjective pairing selection
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• The traveling salesman problem and its variations
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Integrity of systems under decentralized integral control
• Matrix Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item