Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(11 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Benchmarks for Optimization Software / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SIMPL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB2003 / 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/978-3-540-68155-7_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147600044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5241193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPLIB 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics of the Branch-Cut-and-Price-Framework SCIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Solution of Large Mixed Integer Programming Problems with Umpire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Integer Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed logical-linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-two Inequalities, Clique Facets, and Biperfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to integrating mixed integer programming and constraint logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving planning and scheduling problems with combined integer and constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346087 / rank
 
Normal rank

Latest revision as of 10:53, 28 June 2024

scientific article; zbMATH DE number 5279308
Language Label Description Also known as
English
Constraint Integer Programming: A New Approach to Integrate CP and MIP
scientific article; zbMATH DE number 5279308

    Statements

    Constraint Integer Programming: A New Approach to Integrate CP and MIP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references