scientific article; zbMATH DE number 1383707
From MaRDI portal
Publication:4719331
zbMath0978.68791MaRDI QIDQ4719331
Publication date: 24 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items
Hyperplane Arrangements in polymake, A polynomial case of the cardinality-constrained quadratic optimization problem, A class of optimization problems motivated by rank estimators in robust regression, Partial identification in nonseparable binary response models with endogenous regressors, Computing characteristic polynomials of hyperplane arrangements with symmetries, On zero duality gap in nonconvex quadratic programming problems, Improved estimation of duality gap in binary quadratic programming using a weighted distance measure, Reachability determination in acyclic Petri nets by cell enumeration approach, On duality gap in binary quadratic programming, A polynomial case of convex integer quadratic programming problems with box integer constraints, Cell-and-bound algorithm for chance constrained programs with discrete distributions, On reduction of duality gap in quadratic knapsack problems, Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
Uses Software
