Hooked on IP (Q537605)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Hooked on IP	scientific article

Statements

scholarly article

0 references

Hooked on IP (English)

0 references

zbMATH Open document ID

0 references

10.1007/s10479-006-0097-5

0 references

Annals of Operations Research

0 references

publication date

20 May 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

Nemhauser, George I.

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-006-0097-5

0 references

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

Edmonds polytopes and a hierarchy of combinatorial problems

0 references

Solving Large-Scale Zero-One Linear Programming Problems

0 references

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

0 references

An analysis of approximations for maximizing submodular set functions—I

0 references

0 references

Optimal Political Districting by Implicit Enumeration Techniques

0 references

Integer Programming and Pricing

0 references

The fleet assignment problem: Solving a large scale integer program

0 references

Solving large airline crew scheduling problems: Random pairing generation and strong branching

0 references

MINTO, a Mixed INTeger Optimizer

0 references

Vertex packings: Structural properties and algorithms

0 references

0 references

A recursive procedure to generate all cuts for 0-1 mixed integer programs

0 references

On the symmetric travelling salesman problem: A computational study

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:537605

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