Future paths for integer programming and links to artificial intelligence (Q1821034): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/cor/Glover86, #quickstatements; #temporary_batch_1731483406851
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3214706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient reduction for inequalities in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering, Packing and Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between lagrangian and surrogate duality in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis: An Application of Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive characterizations of the value-function of a mixed-integer program. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Results on the New Techniques for Integer Programming Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and mixed-integer programming models: General properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A man-machine approach toward solving the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—On the Use of Fictitious Bounds in Tree Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of Murty's direct algorithm to linear and convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation of Variables in Dynamic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear-Time Algorithm for Graph Realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting embedded generalized networks from linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization procedures for bounded variable primal simplex network algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Simplex Approach to Pure Processing Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational comparison of two solution procedures for allocation/processing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving embedded generalized network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studies in integer programming. Based on material presented at the workshop on integer programming, Bonn, 8-12 September 1975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layering strategies for creating exploitable structure in linear and integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed-integer programming approach to the clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Solution of a Classification Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Large-scale Travelling Salesman Problems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/cor/Glover86 / rank
 
Normal rank

Latest revision as of 08:55, 13 November 2024

scientific article
Language Label Description Also known as
English
Future paths for integer programming and links to artificial intelligence
scientific article

    Statements

    Future paths for integer programming and links to artificial intelligence (English)
    0 references
    0 references
    1986
    0 references
    Integer programming has benefited from many innovations in models and methods. Some of the promising directions for elaborating these innovations in the future may be viewed from a framework that links the perspectives of artificial intelligence and operations research. To demonstrate this, four key areas are examined: (1) controlled randomization, (2) learning strategies, (3) induced decomposition and (4) tabu search. Each of these is shown to have characteristics that appear usefully relevant to developments on the horizon.
    0 references
    artificial intelligence
    0 references
    controlled randomization
    0 references
    learning strategies
    0 references
    induced decomposition
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers