Combinatorial optimization: current successes and directions for the future
type: Item
instance of: scholarly article
title: Combinatorial optimization: current successes and directions for the future
zbMATH Open document ID: 1107.90432
DOI: 10.1016/S0377-0427(00)00430-1
author: Karla L. Hoffman
published in: Journal of Computational and Applied Mathematics
publication date: 2001-01-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 1556997
zbMATH Keywords: Problem formulation
zbMATH Keywords: Cutting planes
zbMATH Keywords: Column-generation
zbMATH Keywords: Heuristics
zbMATH Keywords: Hybrid algorithms
zbMATH Keywords: Parallel processing
zbMATH Keywords: Modeling languages and stochastic optimization
zbMATH Keywords: Solution analysis
describes a project that uses: AMPL
describes a project that uses: AIMMS
describes a project that uses: CPLEX
describes a project that uses: MINTO
describes a project that uses: GAMS
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Presolving in linear programming
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: Gomory cuts revisited
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: Bounds on optimal values in stochastic scheduling
cites work: On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Large-scale 0-1 linear programming on distributed workstations
cites work: Optimization Case Studies in the NEOS Guide
cites work: Q4354785
cites work: Q3274590
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Q4692508
cites work: A computer-assisted analysis system for mathematical programming models and solutions. A user's guide for ANALYZE. Incl. 1 disk
cites work: Analyzing Infeasible Mixed-Integer and Integer Linear Programs
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: Q4331789
cites work: Stochastic Network Programming for Financial Planning Problems
cites work: MINTO, a Mixed INTeger Optimizer
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Linear optimization and extensions
cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
cites work: Q4310695
cites work: Q3996913
cites work: Q4054818
Wikidata QID: Q127907957
description: scientific article; zbMATH DE number 1556997