A discrete meta-control procedure for approximating solutions to binary programs

DOI10.3390/e15093592zbMath1346.90621OpenAlexW2034897700MaRDI QIDQ280551

Wolf Kohn, Pengbo Zhang, Zelda B. Zabinsky

Publication date: 10 May 2016

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/e15093592

zbMATH Keywords

optimal controllarge-scale binary integer programslinear quadratic tracking

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• Dynamic programming. A computational tool.
• A meta-control algorithm for generating approximate solutions to binary integer programming problems
• Stochastic adaptive search for global optimization.
• Combinatorial optimization: current successes and directions for the future
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Optimal Observation for Cyber-physical Systems
• Nested Partitions Method for Global Optimization
• On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms
• Science from Fisher Information
• Practical Genetic Algorithms
• Branch-and-Bound Methods: General Formulation and Properties

This page was built for publication: A discrete meta-control procedure for approximating solutions to binary programs