New perspectives of several fundamental problems in combinatorial optimization

MaRDI QIDQ2923563zbMATH OpenFDO

Authors Xujin Chen, Dachuan Xu, Guochuan Zhang

Publication date 3 November 2014

Published in Operations Research Transactions (Search for Journal in Brave)

zbMATH Keywords

computational complexitycombinatorial optimizationapproximation algorithmspolyhedral combinatoricsmatroid

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Recommendations

• Computing in combinatorial optimization
• Paradigms of combinatorial optimization. Problems and new approaches
• Combinatorial optimization. Abstracts from the workshop held November 4--10, 2018
• scientific article; zbMATH DE number 3887435
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)

Cited in

(7)

• On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
• A new dominance procedure for combinatorial optimization problems
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• scientific article; zbMATH DE number 995809 (Why is no real title available?)
• Computing in combinatorial optimization
• A new view of some fundamental results in optimization
• Seven open problems in applied combinatorics

This page was built for publication: New perspectives of several fundamental problems in combinatorial optimization

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