scientific article

Publication date: 5 June 1993

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

local search matroids time complexity worst-case analysis computability greedy Benders' decomposition heuristic procedures partial enumeration cutting methods exact and nonexact algorithms Lagrangian dual ideas nonpolynomial algorithms time-polynomial algorithms truncated exponential algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Combinatorial aspects of matroids and geometric lattices (05B35) Discrete mathematics in relation to computer science (68Rxx)

Related Items

A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, A graph approximation heuristic for the vertex cover problem on planar graphs, The multiple bottleneck transportation problem, Scheduling for stability in single-machine production systems, Minimizing the weighted number of tardy jobs on parallel processors, New algorithms for pattern matching with wildcards and length constraints, A facility location model for logistics systems including reverse flows: the case of remanufacturing activities, Minimizing the weighted number of tardy jobs on a single machine with release dates, Mathematical programming approach to the Petri nets reachability problem, A heuristic approach to simultaneous course/student timetabling, Implementation of an integer optimization platform using object oriented programming, Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems, General purpose heuristics for integer programming. I, Scatter search and star-paths: Beyond the genetic metaphor, A binary integer linear program with multi-criteria and multi-constraint levels, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, Integer programming models for the \(q\)-mode problem, Lower bound functions for polynomials, Another pedagogy for pure-integer Gomory, Minimizing the weighted number of tardy jobs on a two-machine flow shop., An LP-based algorithm for the data association problem in multitarget tracking., An extension to the single bottleneck transportation problem, A direct heuristic algorithm for linear programming, Parallelizing simulated annealing algorithms based on high-performance computer, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Valid integer polytope (VIP) penalties for branch-and-bound enumeration, An exact algorithm for cost minimization in series reliability systems with multiple component choices, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Lagrangean relaxation with clusters for point-feature cartographic label placement problems, Integer solutions via goal programming to hierarchical systems., MANPAK: A set of algorithms for computations on implicitly defined manifolds, Integer programs for logic constraint satisfaction, A discrete dynamic convexized method for nonlinear integer programming, Paroids: A canonical format for combinatorial optimization, An improved branch and bound algorithm for minimum concave cost network flow problems, Online surrogate problem methodology for stochastic discrete resource allocation problem., On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints, An intelligent algorithm for mixed-integer programming models, Zero duality gap in surrogate constraint optimization: a concise review of models, Revival of the Gomory cuts in the 1990's, Strong valid inequalities for fluence map optimization problem under dose-volume restrictions, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems, Generalized surrogate problem methodology for online stochastic discrete optimization, A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling, Continuous flow models for batch manufacturing: a basis for a hierarchical approach, Decomposition and dynamic cut generation in integer linear programming, A multi-period network design problem for cellular telecommunication systems, A column generation approach for the maximal covering location problem, Optimal harvesting and optimal vaccination, Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times, Exploiting process plan flexibility in production scheduling: A multi-objective approach, Lagrangean/surrogate relaxation for generalized assignment problems, OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION, An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems, Strong duality in optimization: shifted power reformulation, An adaptation of SH heuristic to the location set covering problem, Relaxation heuristics for a generalized assignment problem, Linear programs for constraint satisfaction problems, \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation., Timetable planning using the constraint-based reasoning, Nonlinear nonconvex optimization by evolutionary algorithms applied to robust control, Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour, Nonlinear integer programming by Darwin and Boltzmann mixed strategy, Gomory cuts revisited, Benders-and-cut algorithm for fixed-charge capacitated network design problem, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm, An improved branch and bound algorithm for mixed integer nonlinear programs, A Lagrangian heuristic for capacitated single item lot sizing problems, Global optimization by multilevel search, Minimizing the weighted number of tardy jobs on a single machine