Pages that link to "Item:Q5181541"
From MaRDI portal
The following pages link to Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program (Q5181541):
Displaying 50 items.
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization (Q264238) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- Robust location transportation problems under uncertain demands (Q496635) (← links)
- The indefinite zero-one quadratic problem (Q585083) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- A dynamic production planning and scheduling algorithm for two products processed on one line (Q799234) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Modeling and integer programming techniques applied to propositional calculus (Q918954) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Specialized inspection problems in serial production systems (Q1129930) (← links)
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
- An approximate method for local optima for nonlinear mixed integer programming problems (Q1200840) (← links)
- Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
- A decision model for interdependent information system project selection (Q1266704) (← links)
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems (Q1314325) (← links)
- A new global approach for \(0\)-\(1\) polynomial programs (Q1317077) (← links)
- Configuration of manufacturing software through capability specification and selection (Q1323732) (← links)
- A global approach for general \(0-1\) fractional programming (Q1328656) (← links)
- A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
- Mixed integer programming for the 0--1 maximum probability model. (Q1426689) (← links)
- An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
- A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- Integer programming models and linearizations for the traveling car renter problem (Q1653275) (← links)
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization (Q1654574) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- The min-conflict packing problem (Q1761135) (← links)
