An ODE approach to multiple choice polynomial programming
From MaRDI portal
Cites work
- A method for exact calculation of the discrepancy of low-dimensional finite point sets. I
- A multiple search operator heuristic for the max-k-cut problem
- A new randomized algorithm to approximate the star discrepancy based on threshold accepting
- A polyhedral study of binary polynomial programs
- A simple iterative algorithm for maxcut
- An ODE approach to multiple choice polynomial programming
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- Discrepancy and convex programming
- Discrete dynamical system approaches for Boolean polynomial optimization
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Funktionen von beschränkter Variation in der Theorie der Gleichverteilung
- scientific article; zbMATH DE number 4066656 (Why is no real title available?)
- scientific article; zbMATH DE number 3042316 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Multi-choice programming: an overview of theories and applications
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
- Neurons with graded response have collective computational properties like those of two-state neurons
- Optimization by simulated annealing
- Pseudo-Boolean optimization
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Reducibility among combinatorial problems
- The approximate arithmetic solution by finite differences of physical problems involving differential equations, with an application to the stresses in a masonry dam.
This page was built for publication: An ODE approach to multiple choice polynomial programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020695)
