Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: polynomial programs
Found
26 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Solution to Global Minimization of Polynomials by Backward Differential Flow
2014,
Zhu Jinghao
This paper presents a study on solutions to the global minimization of polynomials....
Handelman rank of zero‐diagonal quadratic programs over a hypercube and its applications
2013,
Hong Sung-Pil
It has been observed that the Handelman’s certificate of positivity of a...
Inverse Polynomial Optimization
2013,
Lasserre Jean B
We consider the inverse optimization problem associated with the polynomial program f...
Computing generalized Nash equilibria by polynomial programming
2013,
Couzoudis Eleftherios
We present a new way to solve generalized Nash equilibrium problems. We assume the...
Multi‐parametric disaggregation technique for global optimization of polynomial programming problems
2013,
Teles Joo
This paper discusses a power‐based transformation technique that is especially...
Necessary Optimality Conditions and New Optimization Methods for Cubic Polynomial Optimization Problems with Mixed Variables
2012,
Li G
Multivariate cubic polynomial optimization problems, as a special case of the general...
A kind of improved univariate multiquadric quasi‐interpolation operators
2010,
Xu Min
In this paper, a kind of improved univariate multiquadric quasi‐interpolation...
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
2012,
Wang Lusheng
Given a directed hypergraph H =( V , E H ), we consider the problem of embedding all...
An algorithm for semi‐infinite polynomial optimization
2012,
Lasserre J
We consider the semi‐infinite optimization problem: f * ≔ min x...
Global optimal solutions to a class of quadrinomial minimization problems with one quadratic constraint
2012,
Yuan Y -B
This paper studies the canonical duality theory for solving a class of quadrinomial...
Reduced RLT representations for nonconvex polynomial programming problems
2012,
Sherali Hanif
This paper explores equivalent, reduced size Reformulation‐Linearization...
Multi‐tier binary solution method for multi‐product newsvendor problem with multiple constraints
2012,
Zhang Bin
This paper considers a multi‐product newsvendor problem with multiple...
On full controllability criteria of a descriptor system. The polynomial solution of a control problem with checkpoints
2011,
Zubova P
We derive full controllability criteria for a stationary dynamical system described by...
Stability investigation for linear periodic time‐delayed systems using Fredholm theory
2011,
Lampe P
A single‐loop linear periodic system with time delay is considered. Using the...
Optimal Edge Ranking of Trees in Linear Time
2001,
Lam T W
Given a tree, finding an optimal node ranking and finding an optimal edge ranking are...
Polynomial Time Approximation Schemes for Some Dense Instances of NP‐Hard Optimization Problems
2001,
Karpinski M
We survey recent results on the existence of polynomial time approximation schemes for...
Counting Hexagonal Patches and Independent Sets in Circle Graphs
2012,
Bonsma Paul
A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices...
Co‐2‐plex polynomials
2011,
McClosky Benjamin
This paper offers a generalization of the independence polynomial, the co‐ k...
A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
2011,
Brink Ren
Recently, applications of cooperative game theory to economic allocation problems have...
A Note on Edge‐based Graph Partitioning and its Linear Algebraic Structure
2011,
Moon Byung-Ro
We analyze two essential problems arising from edge‐based graph partitioning....
Single machine scheduling with total tardiness criterion and convex controllable processing times
2011,
Feng Zuren
We consider a single machine scheduling problem with total tardiness criteria and...
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems
2011,
Tansel Barbaros
The Quadratic Assignment Problem is one of the hardest combinatorial optimization...
Coupled‐task scheduling on a single machine subject to a fixed‐job‐sequence
2011,
Lin Bertrand M T
This paper investigates single‐machine coupled‐task scheduling where...
Two due date assignment problems with position‐dependent processing time on a single‐machine
2011,
Yang Dar-Li
The focus of this study is to analyze single‐machine scheduling and due date...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers