scientific article

Publication date: 1974

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items

Length-bounded disjoint paths in planar graphs, Core-based criterion for extreme supermodular functions, The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem, A pegging approach to the precedence-constrained knapsack problem, A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints, A global optimization algorithm for reliable network design, Decomposition based hybrid metaheuristics, A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern, A branch-cut-and-price algorithm for the piecewise linear transportation problem, Surgical scheduling with simultaneous employment of specialised human resources, Scheduling pumpoff operations in onshore oilfields under electric-power constraints, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems, Two new algorithms for UMTS access network topology design, Preference scheduling for nurses using column generation, On separating cover inequalities for the multidimensional knapsack problem, Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, Large-scale pickup and delivery work area design, Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization, A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow, Lower bounds for the two-stage uncapacitated facility location problem, Designing cost-effective content distribution networks, The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic, Optimal inference for Simon's two-stage design with over or under enrollment at the second stage, Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem, Towards using the chordal graph polytope in learning decomposable models, Optimizing splitter and fiber location in a multilevel optical FTTH network, Lagrangian heuristic for a class of the generalized assignment problems, Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets, A number theoretic reformulation and decomposition method for integer programming, A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization, Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty, Modelling weak disposability in data envelopment analysis under relaxed convexity assumptions, On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., A note on the MIR closure and basic relaxations of polyhedra, A two-phase method for selecting IMRT treatment beam angles: branch-and-prune and local neighborhood search, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, Integer programming, Barvinok's counting algorithm and Gomory relaxations., Designing communication networks for distributed control agents., A note on the MIR closure, Bounds on the size of branch-and-bound proofs for integer knapsacks, Lot sizing and furnace scheduling in small foundries, Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Green design of wireless local area networks by multiband robust optimization, Facets for continuous multi-mixing set with general coefficients and bounded integer variables, A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports, A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals, Changeover formulations for discrete-time mixed-integer programming scheduling models, Models for the piecewise linear unsplittable multicommodity flow problems, Classification of orthogonal arrays by integer programming, The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach, A reduction approach to the repeated assignment problem, A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem, Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs, Cutting planes in integer and mixed integer programming, Optimization models for targeted offers in direct marketing: exact and heuristic algorithms, Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem, On the complexity of cutting-plane proofs using split cuts, A branch-and-price approach to \(p\)-median location problems, Multiple instance learning via margin maximization, A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\), Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, Cutting plane algorithms for \(0-1\) programming based on cardinality cuts, Scheduling elective surgery under uncertainty and downstream capacity constraints, Convex relaxations for mixed integer predictive control, A strengthened formulation and cutting planes for the open pit mine production scheduling problem, Exact solutions to a class of stochastic generalized assignment problems, Scheduling projects with labor constraints, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, A Lagrangian heuristic for satellite range scheduling with resource constraints, A branch-and-cut algorithm for the pallet loading problem, Modeling of period overlapping setup times, Optimizing a linear function over an integer efficient set, Solving a gas-lift optimization problem by dynamic programming, A branch-and-price algorithm for an integrated production and inventory routing problem, Algorithm for optimal winner determination in combinatorial auctions, The cable trench problem: Combining the shortest path and minimum spanning tree problems, Cryptanalysis of a knapsack-based probabilistic encryption scheme, A closed-loop logistic model with a spanning-tree based genetic algorithm, Block-diagonal semidefinite programming hierarchies for 0/1 programming, Approximation algorithms for group prize-collecting and location-routing problems, Cutting-plane theory: Algebraic methods, A parallel optimization approach for controlling allele diversity in conservation schemes, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, A note on the virtual crystal approach to alloy optimization, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming, A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, International trade and biological invasions: a queuing theoretic analysis of the prevention problem, Evolution and state-of-the-art in integer programming, Combinatorial optimization: current successes and directions for the future, Formulating logical implications in combinatorial optimisation, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations, Optimization models for ATM network planning