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