A discrete meta-control procedure for approximating solutions to binary programs
Summary: Large-scale binary integer programs occur frequently in many real-world applications. For some binary integer problems, finding an optimal solution or even a feasible solution is computationally expensive. In this paper, we develop a discrete meta-control procedure to approximately solve large-scale binary integer programs efficiently. The key idea is to map the vector of n binary decision variables into a scalar function defined over a time interval \([0,n]\) and construct a linear quadratic tracking (LQT) problem that can be solved efficiently. We prove that an LQT formulation has an optimal binary solution, analogous to a classical bang-bang control in continuous time. Our LQT approach can provide advantages in reducing computation while generating a good approximate solution. Numerical examples are presented to demonstrate the usefulness of the proposed method.
- A meta-control algorithm for generating approximate solutions to binary integer programming problems
- Effective algorithms for a class of discrete valued optimal control problems
- scientific article; zbMATH DE number 923887
- 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
- A meta-control algorithm for generating approximate solutions to binary integer programming problems
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Branch-and-Bound Methods: General Formulation and Properties
- Branch-and-price: Column generation for solving huge integer programs
- Combinatorial optimization: current successes and directions for the future
- Dynamic programming. A computational tool.
- scientific article; zbMATH DE number 2117227 (Why is no real title available?)
- 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
- Optimal Observation for Cyber-physical Systems
- Optimization by simulated annealing
- Practical Genetic Algorithms
- Science from Fisher Information
- Stochastic adaptive search for global optimization.
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)
