scientific article; zbMATH DE number 3501240
From MaRDI portal
Publication:4082544
Exact enumeration problems, generating functions (05A15) Extremal problems in graph theory (05C35) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Integer programming (90C10) Programming involving graphs or networks (90C35)
Cited in
(52)- Hybrid approach to the rational management of machine replacement
- Solving constrained optimization problems using a novel genetic algorithm
- A real coded genetic algorithm for solving integer and mixed integer optimization problems
- An efficient algorithm for the complete set partitioning problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- Some models for water distribution systems
- Pick-and-choose heuristics for partial set covering
- Two backtrack algorithms for the ratio frequency intermodulation problem
- Optimal algorithms for sensitivity analysis in associative multiplication problems
- The 0-1 integer programming problem in a finite ring with identity
- An algorithm for the multiple objective integer linear programming problem
- A transfer algorithm for hierarchical clustering
- A search algorithm for the minimum cost covering of 0-1 integers sets
- Gruppenspezifische Auswahl von Diagnosestrategien im Bereich der Hypertoniefrueherkennung. Ein Modell der linearen 0/1-Programmierung
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Location and sizing of offshore platforms for oil exploration
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach
- A language and a program for stating and solving combinatorial problems
- Discrete right hand side parametrization for linear integer programs
- Using the Blankinship algorithm to find the general solution of a linear diophantine equation
- Establishment of economic production rate, production batch size, and production sequence in manufacturing systems with flexible routing
- Integration of operation routing and economic production quantity decisions in batch manufacturing systems
- Structural approach to parametric analysis of an IP. On the case of the right-hand side
- Ranking in quadratic integer programming problems
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
- Optimization algorithms of operative control in water distribution systems
- A binary integer linear program with multi-criteria and multi-constraint levels
- Constrained integer fractional programming problem with box constraints
- A sequential aggregation algorithm for the set partitioning problem
- Future paths for integer programming and links to artificial intelligence
- The simple plant location problem: Survey and synthesis
- The application of integer linear programming to the implementation of a graphical user interface: A new rectangular packing problem
- Scatter search and star-paths: Beyond the genetic metaphor
- A new QPSO based hybrid algorithm for constrained optimization problems via tournamenting process
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
- A self-organizing migrating genetic algorithm for constrained optimization
- A heuristic algorithm for the fixed charge problem
- Ranking in integer programming with bounded variables.
- Using branch-and-bound algorithms to obtain suboptimal solutions
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- A hard knapsack problem
- Designing satellite communication networks by zero—one quadratic programming
- An Improved Branch and Bound Method for Mixed Integer Linear Fractional Programs
- Computational results with a branch-and-bound algorithm for the general knapsack problem
- Shortest-path network interdiction
- Ranking in integer linear fractional programming problems
- Classical cuts for mixed-integer programming and branch-and-cut
- Foundations of operations research: from linear programming to data envelopment analysis
- Alternative group relaxation of integer programming problems
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
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 Q4082544)
