scientific article; zbMATH DE number 2166303
From MaRDI portal
Publication:4673630
Cited in
(81)- Finding non-dominated solutions in bi-objective integer network flow problems
- Stable and unstable numerical boundary conditions for Galerkin approximations to hyperbolic systems
- A case of non-convergent dual changes in assignment problems
- A nonlinear hierarchical approach for incorporating solar generation units in electric utility capacity expansion plans
- An algorithm for optimal resource allocation in systems with linear constraints
- A transportation type aggregate production model with bounds on inventory and backordering
- Network flow problems with one side constraint: A comparison of three solution methods
- Search-hide games on trees
- A comparison of interval linear programming with the simplex method
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Bicriteria network flow problems: Continuous case
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
- An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems
- The return plant location problem: Modelling and resolution
- A novel approach to robust parameter estimation using neurofuzzy systems
- A recognition problem in converting linear programming to network flow models
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- Efficient enumeration of the vertices of polyhedra associated with network LP's
- Inference flexibility in Horn clause knowledge bases and the simplex method
- Local optima topology for the \(k\)-coloring problem
- A subgradient-based optimization for reservois system management
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- Topology optimization of flow networks.
- Branch-and-price algorithm for fuzzy integer programming problems with block angular structure
- A trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems
- The role of stochastic programming in communication network design
- A basis-defiency-allowing variation of the simplex method for linear programming
- A labeling algorithm to solve the assignment problem
- Finite method for a nonlinear allocation problem
- A heuristic solution procedure for multicommodity integer flows
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- Weak optimal inverse problems of interval linear programming based on KKT conditions
- A multiple objective programming approach to linear bilevel multi-follower programming
- An algorithm for solving fixed-charge problems using surrogate constraints
- A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier
- A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
- Decomposition algorithms for finding the shortest path between a source node and a sink node of a network
- Time minimizing flows in directed networks
- scientific article; zbMATH DE number 5772889 (Why is no real title available?)
- A nested Benders decomposition approach for telecommunication network planning
- Nonadjacent extreme point methods for solving linear programs
- Réduction de la résolution d'un problème de réseau maillé (B) : sur la convergence locale de certaines méthodes
- scientific article; zbMATH DE number 3934757 (Why is no real title available?)
- scientific article; zbMATH DE number 4060988 (Why is no real title available?)
- On the use of lexicographic min cost flows in evacuation modeling
- scientific article; zbMATH DE number 4066615 (Why is no real title available?)
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- A simple algebraic proof of Farkas's lemma and related theorems
- Primal transportation and transshipment algorithms
- Decomposition algorithms for minimal cut problems
- A Stochastic Flow Problem
- Decomposition algorithms for locating minimal cuts in a network
- A decomposition algorithm for locating a shortest path between two nodes in a network
- Réduction de la résolution d'un problème de réseau maillé
- A property regarding degenerate pivots for linear assignment networks
- Cumulative search-evasion games
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- scientific article; zbMATH DE number 3461750 (Why is no real title available?)
- A product form representation of the inverse of a multicommodity cycle matrix
- A risk function for the stochastic modeling of electric capacity expansion
- Robust estimation of parametric membership regions
- Flexible optimization of machining variables using constrained R-T characteristic curve
- Biobjective sparse principal component analysis
- New approach on robust and reliable decentralized H_ tracking control for fuzzy interconnected systems with time-varying delay
- Optimum feedback patterns in multivariable control systems
- The flow circulation sharing problem
- Generalized characterization of tracking systems and linear multivariable plants
- Synthesis of limit-tracking systems incorporating linear multivariable plants
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
- Optimization of a linear function over an integer efficient set
- Minimal-cost network flow problems with variable lower bounds on arc flows
- Robust reverse 1-center problems on trees with interval costs
- An initialization technique for the dual support method of linear programming with nonnegative variables
- A complete algorithm for linear fractional programs
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- Handling organ motion in radiotherapy of cancer via Markov chains
- Canonical bases in linear programming
- Replacing unification by constraint satisfaction to improve logic program expressiveness
- The basis suppression method
- Finding strong defining hyperplanes of PPS using multiplier form
- Delay-dependent robust and reliable \(H_\infty\) fuzzy hyperbolic decentralized control for uncertain nonlinear interconnected systems
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 Q4673630)
