Information-based branching schemes for binary linear mixed integer problems (Q2267352): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / 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: On the maximum feasible subsystem problem, IISs and IIS-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved strategies for branching on general disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Intelligent Backtracking Using Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / 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: Information-theoretic approaches to branching in search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Minimally Infeasible Subsystems of Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching on general disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-constraint variable ordering for faster feasibility of mixed integer linear programs / 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

Revision as of 11:42, 2 July 2024

scientific article
Language Label Description Also known as
English
Information-based branching schemes for binary linear mixed integer problems
scientific article

    Statements

    Information-based branching schemes for binary linear mixed integer problems (English)
    0 references
    1 March 2010
    0 references
    variable selection
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references