Projection with a Minimal System of Inequalities
Computational Optimization and Applications
Structural alignment of large—size proteins via lagrangian relaxation
Proceedings of the sixth annual international conference on Computational biology
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems
Journal of Global Optimization
Generating Convex Polynomial Inequalities for Mixed 0–1 Programs
Journal of Global Optimization
Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems
Journal of Global Optimization
The disjunctive procedure and blocker duality
Discrete Applied Mathematics
On the Separation of Maximally Violated mod-k Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Chvátal Rank of Certain Inequalities
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Generating Cuts from Multiple-Term Disjunctions
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Cutting Planes for Mixed 0-1 Semidefinite Programs
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Rank of Mixed 0, 1 Polyhedra
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Projection and Lifting in Combinatorial Optimization
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Lift-and-project for mixed 0-1 programming: recent progress
Discrete Applied Mathematics
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
Computational Optimization and Applications
An augment-and-branch-and-cut framework for mixed 0-1 programming
Combinatorial optimization - Eureka, you shrink!
A simplex-based algorithm for 0-1 mixed integer programming
Combinatorial optimization - Eureka, you shrink!
Lift and project relaxations for the matching and related polytopes
Discrete Applied Mathematics
The Knowledge Engineering Review
IBM Journal of Research and Development
Computational Optimization and Applications
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
On the commutativity of antiblocker diagrams under lift-and-project operators
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
The quadratic knapsack problem-a survey
Discrete Applied Mathematics
Computation of the Lasserre Ranks of Some Polytopes
Mathematics of Operations Research
Annals of Mathematics and Artificial Intelligence
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs
International Journal of Computational Science and Engineering
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Journal of Global Optimization
Cuts for Conic Mixed-Integer Programming
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A geometric characterization of "optimality-equivalent" relaxations
Journal of Global Optimization
On the relative strength of split, triangle and quadrilateral cuts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A linearization framework for unconstrained quadratic (0-1) problems
Discrete Applied Mathematics
Sherali-adams relaxations of the matching polytope
Proceedings of the forty-first annual ACM symposium on Theory of computing
Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
INFORMS Journal on Computing
A p-cone sequential relaxation procedure for 0-1 integer programs
Optimization Methods & Software - GLOBAL OPTIMIZATION
Extended Formulations for Packing and Partitioning Orbitopes
Mathematics of Operations Research
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An Integrated Solver for Optimization Problems
Operations Research
Perspective relaxation of mixed integer nonlinear programs with indicator variables
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Disjunctive cuts for non-convex mixed integer quadratically constrained programs
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs
Discrete Applied Mathematics
Letter to the editor: An efficient linearization technique for mixed 0-1 polynomial problem
Journal of Computational and Applied Mathematics
Breaking the rectangle bound barrier against formula size lower bounds
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Note: On the behavior of the N+-operator under blocker duality
Discrete Applied Mathematics
SIAM Journal on Optimization
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
Computers and Operations Research
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Lift-and-project cuts for mixed integer convex programs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Design and verify: a new scheme for generating cutting-planes
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
An iterative scheme for valid polynomial inequality generation in binary polynomial programming
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Convexification techniques for linear complementarity constraints
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Split Rank of Triangle and Quadrilateral Inequalities
Mathematics of Operations Research
An exact algorithm for the 0---1 linear knapsack problem with a single continuous variable
Journal of Global Optimization
Experiments with Two-Row Cuts from Degenerate Tableaux
INFORMS Journal on Computing
Improving cutting plane generation with 0-1 inequalities by bi-criteria separation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On the rank of cutting-plane proof systems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Branch and cut methods for network optimization
Mathematical and Computer Modelling: An International Journal
Exploiting equalities in polynomial programming
Operations Research Letters
Exact MAX-2SAT solution via lift-and-project closure
Operations Research Letters
Random half-integral polytopes
Operations Research Letters
Block-diagonal semidefinite programming hierarchies for 0/1 programming
Operations Research Letters
Approximate formulations for 0-1 knapsack sets
Operations Research Letters
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture
Operations Research Letters
Relaxations of linear programming problems with first order stochastic dominance constraints
Operations Research Letters
Note: On the polyhedral lift-and-project methods and the fractional stable set polytope
Discrete Optimization
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization
Intermediate integer programming representations using value disjunctions
Discrete Optimization
Column basis reduction and decomposable knapsack problems
Discrete Optimization
Operations Research Letters
Foundation-penalty cuts for mixed-integer programs
Operations Research Letters
Elementary closures for integer programs
Operations Research Letters
Lift-and-project ranks and antiblocker duality
Operations Research Letters
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
Operations Research Letters
On linear programs with linear complementarity constraints
Journal of Global Optimization
Lift-and-project ranks of the set covering polytope of circulant matrices
Discrete Applied Mathematics
Fenchel decomposition for stochastic mixed-integer programming
Journal of Global Optimization
Intersection cuts for mixed integer conic quadratic sets
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
0/1 polytopes with quadratic chvátal rank
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
A New Local Search Algorithm for Binary Optimization
INFORMS Journal on Computing
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
Journal of Global Optimization
Combining Lift-and-Project and Reduce-and-Split
INFORMS Journal on Computing
Maximum expert consensus models with linear cost function and aggregation operators
Computers and Industrial Engineering
On the facets of lift-and-project relaxations under graph operations
Discrete Applied Mathematics
| Hi-index | 0.00 |