The indefinite zero-one quadratic problem (Q585083): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C09
@@ Property / Mathematics Subject Classification ID: 90C09 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 90C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K05
@@ Property / Mathematics Subject Classification ID: 65K05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+3831677
@@ Property / zbMATH DE Number: 3831677 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+indefinite 0-1 quadratic programming
@@ Property / zbMATH Keywords: indefinite 0-1 quadratic programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+equivalent positive definite problem
@@ Property / zbMATH Keywords: equivalent positive definite problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+branch and bound algorithm
@@ Property / zbMATH Keywords: branch and bound algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational results
@@ Property / zbMATH Keywords: computational results / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+random test problems
@@ Property / zbMATH Keywords: random test problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+transformation
@@ Property / zbMATH Keywords: transformation / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Duality in Discrete Programming: II. The Quadratic Case
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Interaction Cost
@@ Property / cites work: Scheduling to Minimize Interaction Cost / rank @@
+Normal rank
@@ Property / cites work @@
+Quadratic knapsack problems
@@ Property / cites work: Quadratic knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Newton-type methods for unconstrained and linearly constrained optimization
+Normal rank
@@ Property / cites work @@
+Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
+Normal rank
@@ Property / cites work @@
+Q5613011
@@ Property / cites work: Q5613011 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684504
@@ Property / cites work: Q5684504 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5343725
@@ Property / cites work: Q5343725 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5627920
@@ Property / cites work: Q5627920 / rank @@
+Normal rank
@@ Property / cites work @@
+Quadratic Binary Programming with Application to Capital-Budgeting Problems
+Normal rank
@@ Property / cites work @@
+An Implicit Enumeration Algorithm for Quadratic Integer Programming
+Normal rank
@@ Property / cites work @@
+A Balasian-Based Algorithm for Zero-One Polynomial Programming
+Normal rank
@@ Property / cites work @@
+Q5674306
@@ Property / cites work: Q5674306 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(84)90111-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2090739911
@@ Property / OpenAlex ID: W2090739911 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:585083