scientific article; zbMATH DE number 193499
From MaRDI portal
Publication:4040299
zbMATH Open0652.90068MaRDI QIDQ4040299FDOQ4040299
Authors: R. G. Parker, Ronald L. Rardin 
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Recommendations
local searchgreedymatroidstime complexityworst-case analysisBenders' decompositioncomputabilityheuristic procedurespartial enumerationcutting methodsexact and nonexact algorithmsLagrangian dual ideasnonpolynomial algorithmstime-polynomial algorithmstruncated exponential algorithms
Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Integer programming (90C10) Mixed integer programming (90C11) Combinatorial aspects of matroids and geometric lattices (05B35) Discrete mathematics in relation to computer science (68Rxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (87)
- A multi-period network design problem for cellular telecommunication systems
- Title not available (Why is that?)
- New algorithms for pattern matching with wildcards and length constraints
- Title not available (Why is that?)
- Unlocking Your Bike the Easy Way
- Integer solutions via goal programming to hierarchical systems.
- Algorithms for solving a separable problem of discrete optimization
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach
- Global optimization by multilevel search
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Strong duality in optimization: shifted power reformulation
- Implementation of an integer optimization platform using object oriented programming
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration
- A graph approximation heuristic for the vertex cover problem on planar graphs
- Title not available (Why is that?)
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- An extension to the single bottleneck transportation problem
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- Generalized surrogate problem methodology for online stochastic discrete optimization
- Revival of the Gomory cuts in the 1990's
- The multiple bottleneck transportation problem
- Linear programs for constraint satisfaction problems
- Scatter search and star-paths: Beyond the genetic metaphor
- An LP-based algorithm for the data association problem in multitarget tracking.
- Title not available (Why is that?)
- Mathematical programming approach to the Petri nets reachability problem
- Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A direct heuristic algorithm for linear programming
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Minimizing the weighted number of tardy jobs on parallel processors
- Exploiting process plan flexibility in production scheduling: A multi-objective approach
- Optimal harvesting and optimal vaccination
- Timetable planning using the constraint-based reasoning
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Integer programming models for the \(q\)-mode problem
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
- A facility location model for logistics systems including reverse flows: the case of remanufacturing activities
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Title not available (Why is that?)
- Online surrogate problem methodology for stochastic discrete resource allocation problem.
- An adaptation of SH heuristic to the location set covering problem
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- A discrete dynamic convexized method for nonlinear integer programming
- Lagrangean/surrogate relaxation for generalized assignment problems
- Integer programs for logic constraint satisfaction
- Minimizing the weighted number of tardy jobs on a single machine
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Gomory cuts revisited
- Nonlinear discrete optimization. An algorithmic theory
- A column generation approach for the maximal covering location problem
- Disjunctive optimization: Critical point theory
- Lower bound functions for polynomials
- Nonlinear nonconvex optimization by evolutionary algorithms applied to robust control
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
- Relaxation heuristics for a generalized assignment problem
- MANPAK: A set of algorithms for computations on implicitly defined manifolds
- Discrete optimization under interval uncertainty
- Scheduling for stability in single-machine production systems
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- An exact algorithm for cost minimization in series reliability systems with multiple component choices
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- A heuristic approach to simultaneous course/student timetabling
- Parallelizing simulated annealing algorithms based on high-performance computer
- Nonlinear integer programming by Darwin and Boltzmann mixed strategy
- Paroids: A canonical format for combinatorial optimization
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- OPTi's Algorithm for Discreteness Determination
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems
- An intelligent algorithm for mixed-integer programming models
- Optimization of discrete systems
- A binary integer linear program with multi-criteria and multi-constraint levels
- Another pedagogy for pure-integer Gomory
- A Lagrangian heuristic for capacitated single item lot sizing problems
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- Decomposition and dynamic cut generation in integer linear programming
- General purpose heuristics for integer programming. I
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
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 Q4040299)
