Sign in
Facet browsing currently unavailable
Page 3 of 4059 results
Sort by: relevance publication year
|
General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems JOURNAL ARTICLE published August 2010 in Discrete Optimization |
|
Inverse multi-objective combinatorial optimization JOURNAL ARTICLE published November 2013 in Discrete Applied Mathematics |
|
13. Algebraic Independent Set Problems BOOK CHAPTER published 1981 in Linear and Combinatorial Optimization in Ordered Algebraic Structures |
|
On the depth of combinatorial optimization problems JOURNAL ARTICLE published May 1993 in Discrete Applied Mathematics |
|
Combinatorial optimization problems with balanced regret JOURNAL ARTICLE published March 2023 in Discrete Applied Mathematics |
|
Linear and Combinatorial Optimization in Ordered Algebraic Structures BOOK published 1981 in Annals of Discrete Mathematics |
|
Adapting polyhedral properties from facility to hub location problems JOURNAL ARTICLE published December 2004 in Discrete Applied Mathematics |
|
Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming JOURNAL ARTICLE published October 2004 in Electronic Notes in Discrete Mathematics |
|
From algebraic sets to monomial linear bases by means of combinatorial algorithms JOURNAL ARTICLE published May 1995 in Discrete Mathematics |
|
Smart elements in combinatorial group testing problems with more defectives JOURNAL ARTICLE published 14 August 2020 in The Art of Discrete and Applied Mathematics |
|
Scheduling a single machine to minimize a regular objective function under setup constraints JOURNAL ARTICLE published March 2005 in Discrete Optimization |
|
Analysis of discrete fractional operators JOURNAL ARTICLE published 2015 in Applicable Analysis and Discrete Mathematics |
|
Hardness results for Multimarginal Optimal Transport problems JOURNAL ARTICLE published November 2021 in Discrete Optimization Research funded by National Science Foundation (1122374) |
|
The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes JOURNAL ARTICLE published January 2007 in SIAM Journal on Discrete Mathematics |
|
A new family of combinatorial numbers and polynomials associated with peters numbers and polynomials JOURNAL ARTICLE published 2020 in Applicable Analysis and Discrete Mathematics |
|
A combinatorial identity for a problem in asymptotic statistics JOURNAL ARTICLE published 2009 in Applicable Analysis and Discrete Mathematics |
|
Preface JOURNAL ARTICLE published April 1993 in Discrete Applied Mathematics |
|
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization JOURNAL ARTICLE published October 2020 in Discrete Applied Mathematics |
|
JOURNAL ARTICLE published May 2008 in Discrete Optimization |
|
Heuristically guided algorithm for k-parity matroid problems JOURNAL ARTICLE published 1978 in Discrete Mathematics |
![Cite](javascript:showCiteBox("10.1016/j.disopt.2007.08.004", "<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>ε</mml:mi></mml:math>-optimization schemes and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>L</mml:mi></mml:math>-bit precision: Alternative perspectives for solving combinatorial optimization problems");){kind=link}