Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods (original) (raw)
Related papers
An Algebraic Theory of Complexity for Discrete Optimization
SIAM Journal on Computing, 2013
A New Algebraic Geometry Algorithm for Integer Programming
Management Science, 2000
The algebraic degree of geometric optimization problems
Discrete & Computational Geometry, 1988
Geometric Methods in Combinatorial Optimization
Progress in Combinatorial Optimization, 1984
Geometric optimization and the polynomial hierarchy
Theoretical Computer Science, 1987
An algebraic theory of complexity for discrete optimisation
Optimization over polynomials: Selected topics
Algebraic methods for optimization problems
2002
Special issue on: Computational discrete optimization
EURO Journal on Computational Optimization
Computational Geometry and Linear Programming(Computational Geometry and Discrete Geometry)
1994
Computational Optimization and Applications, 1996
Continuous Representation Techniques in Combinatorial Optimization
Computability and Complexity of Polynomial Optimization Problems
Lecture Notes in Economics and Mathematical Systems, 1992
Combinatorial Optimization and Theoretical Computer Science
2008
Mixed-integer Nonlinear Optimization: A Hatchery for Modern Mathematics
Oberwolfach Reports, 2015
Some aspects of studying an optimization or decision problem in different computational models
European Journal of Operational Research, 2002
Combinatorial Optimization: An Introduction
Universitext, 2001
Chapman & Hall/CRC Applied Algorithms and Data Structures series, 1998
Notes on Combinatorial Optimization
Robust algebraic methods for geometric computing
ACM Communications in Computer Algebra, 2012
Semidefinite programming in combinatorial and polynomial optimization
Straight-line programs in geometric elimination theory
Journal of Pure and …, 1998
Preface: Special Issue on Combinatorial Optimization
Journal of the Operations Research Society of China, 2019
Solving polynomial optimization problems via the truncated tangency variety and sums of squares
Journal of Pure and Applied Algebra, 2009
Chapter 10: Algebraic Algorithms
Algebraic Structures and Applications
Springer proceedings in mathematics & statistics, 2020
A computational study of methods for solving polynomial geometric programs
Journal of Optimization Theory and Applications, 1976
Computationally attractive non-linear models for combinatorial optimisation
International Journal of Mathematics in Operational Research, 2009
Algebraic-geometric methods for complexity lower bounds
2004
Combinatorial algorithms for optimization problems
1991
An introduction to convexity, polyhedral theory and combinatorial optimization
The complexity of linear programming
Theoretical Computer Science, 1980
On the equivalence of algebraic approaches to the minimization of forms on the simplex
2005
Sampling Algebraic Varieties for Sum of Squares Programs
SIAM Journal on Optimization
Nonlinear Discrete Optimization
2010