Continuous reformulations for zero-one programming problems (Q415420): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-011-9935-y / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: FEASPUMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-011-9935-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054895961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding independent sets in a graph using continuous multivariable polynomial formulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing test functions for global optimization using continuous formulations of graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack feasibility as an absolute value equation solvable by successive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonlinear optimization problems with binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact penalty approach for solving a class of minimization problems with boolean variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty for zero–one integer equivalent problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty formulation for zero-one nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty functions for nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the equivalence between zero-one programming and continuous concave programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty parameter for linearly constrained 0--1 quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-011-9935-Y / rank
 
Normal rank

Latest revision as of 16:50, 9 December 2024

scientific article
Language Label Description Also known as
English
Continuous reformulations for zero-one programming problems
scientific article

    Statements

    Continuous reformulations for zero-one programming problems (English)
    0 references
    8 May 2012
    0 references
    zero-one programming
    0 references
    concave functions
    0 references
    continuous programming
    0 references
    0 references
    0 references

    Identifiers