Faster MIP solutions via new node selection rules (Q2270439)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Faster MIP solutions via new node selection rules	scientific article

Statements

scholarly article

Faster MIP solutions via new node selection rules (English)

Daniel T. Wojtaszek

John W. Chinneck

Computers \& Operations Research

publication date

18 March 2010

zbMATH Keywords

mixed-integer programming

node selection rules

branch and bound

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.cor.2009.11.011

Branching rules revisited

SCIP: solving constraint integer programs

Integer-programming software systems

Experiments in mixed-integer linear programming

A tree-search algorithm for mixed integer programming problems

Benchmarking optimization software with performance profiles.

Practical Solution of Large Mixed Integer Programming Problems with Umpire

Experiments in mixed-integer linear programming using pseudo-costs

Genetic Programming

A Computational Study of Search Strategies for Mixed Integer Programming

Investigation of some branch and bound strategies for the solution of mixed integer linear programs

Active-constraint variable ordering for faster feasibility of mixed integer linear programs

Identifiers

zbMATH Open document ID

10.1016/j.cor.2009.11.011

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:2270439

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2270439&oldid=35157094"