scientific article; zbMATH DE number 1021641
The articles of this volume will be reviewed individually. Indexed articles: \textit{Maros, István; Mitra, Gautam}, Simplex algorithms, 1-46 [Zbl 0906.90122] \textit{Roos, Cornelis; Vial, Jean-Philippe}, Interior point methods, 47-102 [Zbl 0906.90124] \textit{Gondzio, Jacek; Terlaky, Tamás}, A computational view of interior point methods, 103-144 [Zbl 1010.90524] \textit{Resende, Mauricio G. C.; Pardalos, Panos M.}, Interior point algorithms for network flow problems, 145-185 [Zbl 1010.90525] \textit{Lucena, Abilio; Beasley, John E.}, Branch and cut algorithms, 187-221 [Zbl 0934.90083] \textit{Mitchell, John E.}, Interior point algorithms for integer programming, 223-248 [Zbl 0905.90125] \textit{Williams, H. Paul; Brailsford, Sally C.}, Computational logic and integer programming, 249-281 [Zbl 0937.90508]
- Developments in linear and integer programming
- Advances in optimization and linear programming
- Advances in linear and nonlinear programming
- Linear programming: recent advances
- Recent advances in integer programming
- Linear integer programming. Theory, applications, recent developments
- Commentary—Progress in Linear Programming
- Linear and integer optimization. Theory and practice
- Some recent advances and new directions in linear programming
- scientific article; zbMATH DE number 4089320
- Criss-cross methods: A fresh view on pivot algorithms
- General purpose heuristics for integer programming. I
- Nurse rostering problems -- a bibliographic survey.
- Evolution and state-of-the-art in integer programming
- Future paths for integer programming and links to artificial intelligence
- Using Lagrangian dual information to generate degree constrained spanning trees
- Advances in linear and nonlinear programming
- Preprocessing composite cutting procedure: an approach to the integer model
- Recent advances in the decomposition approach to linear programming
- Commentary—Progress in Linear Programming
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- Advances in Combinatorial Optimization
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 Q4340910)