Skip to Main Content (Press Enter)
×
Home
People
Outputs
Organizations
Expertise & Skills
IT
EN
☰
UNI-FIND
|
UNI-FIND
cnr.it
IT
EN
×
Home
People
Outputs
Organizations
Expertise & Skills
☰
Outputs
MATHEMATICAL PROGRAMMING
Journal
Identifier:
E106809
ISSN:
0025-5610
Overview
Overview
Outputs (27)
Clear
Sort by Outputs:
ascendant
decrescent
A Stabilized Structured Dantzig-Wolfe Decomposition Method
Academic Article
A Storm of Feasibility Pumps for Nonconvex MINLP
Academic Article
A magnetic resonance device designed via global optimization techniques
Academic Article
A magnetic resonance device designed via global optimization techniques
Academic Article
An accelerated central cutting plane algorithm for linear semi-infinite programming
Academic Article
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Academic Article
Bilinear programming: an exact algorithm
Academic Article
Budgeted Matching and Budgeted Matroid Intersection via the Gasoline Puzzle
Academic Article
Bundle methods for sum-functions with "easy" components: Applications to multicommodity network design
Academic Article
Combinatorial Optimization
Edited Book
Combinatorial Optimization and Integer Programming
Academic Article
Easy and Difficult Objective Functions for Max Cut
Academic Article
Index Information Algorithm with Local Tuning for Solving Multidimensional Global Optimization Problems with Multiextremal Constraints
Academic Article
Lifting and Separation Procedures for the Cut Polytope
Academic Article
Max Horn SAT and the Minimum Cut Problem in Directed Hypergraphs
Academic Article
New Approaches for Optimizing over the Semimetric Polytope
Academic Article
Objective-derivative-free methods for constrained optimization
Academic Article
On the Chromatic Polynomial of a Graph
Academic Article
Optimization via enumeration: a new algorithm for the Max Cut problem
Academic Article
Perspective cuts for a class of convex 0-1 mixed integer programs
Academic Article
Preface
Chapter
Primal Separation for 0/1 Polytopes
Academic Article
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Academic Article
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Academic Article
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
Academic Article
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs
Academic Article
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
Academic Article
No Results Found
«
‹
{pageNumber}
›
»
{startItem} - {endItem} of {itemsNumber}
5 per page
10 per page
30 per page
view all
