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

DOI10.3390/E15093592zbMATH Open1346.90621OpenAlexW2034897700MaRDI QIDQ280551FDOQ280551

Authors: Pengbo Zhang, Wolf Kohn, 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

Recommendations

• A meta-control algorithm for generating approximate solutions to binary integer programming problems
• Effective algorithms for a class of discrete valued optimal control problems
• Publication:4891372
• Discrete approximation of relaxed optimal control problems
• An approximation to discrete optimal feedback controls
• Approximate solution of the discrete optimal control problem
• scientific article; zbMATH DE number 1969630
• A measure-theoretical approach for solving discrete optimal control problems
• A Convex Optimization Approach to Discrete Optimal Control
• An approximate optimal control for discrete models: its design

zbMATH Keywords

optimal controllarge-scale binary integer programslinear quadratic tracking

Mathematics Subject Classification ID

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

Cites Work

• Optimization by simulated annealing
• Branch-and-price: Column generation for solving huge integer programs
• Practical Genetic Algorithms
• Title not available (Why is that?)
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• 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
• 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
• Branch-and-Bound Methods: General Formulation and Properties
• Dynamic programming. A computational tool.

Cited In (1)

• A meta-control algorithm for generating approximate solutions to binary integer programming problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280551)