scientific article; zbMATH DE number 863497

zbMATH Open0854.90117MaRDI QIDQ4871776FDOQ4871776

Authors: Martin Grötschel, László Lovász 

Publication date: 8 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• Combinatorial optimization. Theory and algorithms
• scientific article; zbMATH DE number 1102774

zbMATH Keywords

dynamic programminggreedy algorithmenumerationbranch-and-boundlocal improvementmatrix methodsaugmenting pathsuncrossing

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cited In (30)

• Title not available (Why is that?)
• Production-process optimization algorithm: application to fed-batch bioprocess
• Iterative methods in combinatorial optimization.
• Non-standard approaches to integer programming
• On the relative complexity of 15 problems related to~0/1-integer programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
• Title not available (Why is that?)
• Test sets of integer programs
• Normal Forms and Unfoldings for Local Dynamical Systems
• Putting continuous metaheuristics to work in binary search spaces
• On dependent randomized rounding algorithms
• Optimization problems involving collections of dependent objects
• The greedy algorithm as a combinatorial principle
• Greedily finding a dense subgraph
• Research trends in combinatorial optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer Programming: Optimization and Evaluation Are Equivalent
• Combinatorial optimization with interaction costs: complexity and solvable cases
• Computing in combinatorial optimization
• Advances in combinatorial optimization
• Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
• Title not available (Why is that?)
• Dynamic programming multi-objective combinatorial optimization
• Data correcting approaches in combinatorial optimization.
• On the connection of hypergraph theory with formal concept analysis and rough set theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871776)