text:
Talk:Capture of Saddam Hussein

Headline text
I just removed a rather strange part that was added. Can we accept this? Seems very biased, and doesn't link to any sources. Just speculation! It is questionable whether it was actually Saddam Hussein that the American Forces captured, unrevealed sources say. It is possible that since American morale has been dropping in recent months, and with over 200 American soldiers killed after the war in Iraq had ended, the Bush administration needed a morale booster!

 * I think there should be some mention of the belief by some that Saddam has not been captured, but it may be more appropriate for the Saddam Hussein article itself, not this article. And I needs to be rephrased either way as the removed portion is obviously biased. --Flockmeal 22:30, Dec 15, 2003 (UTC)

I am intrigued by the surreal atmosphere about this entire war. There is a confusion between reality and fantasy: the names of operations, the rumors, the purpose. Every time a new story comes out, there is this question of conspiracy and confabulation. Any takes on why there is such confusion about this story and the others coming from Iraq?

 * Yup - the anti-war people don't want to believe it because it undermines their case that the occupation is failing... -- ChrisO 21:41, 15 Dec 2003 (UTC)
 * True; for that, one need only read the headlines from Iraq (as opposed to briefings from the Pentagon). -- Anon.
 * It's probably mainly to with the growing lack of trust in the governments involved. -- Sam
 * How's it working out, ChrisO? :) Dave420 13:56, 27 September 2006 (UTC)
 * I lol'd hard. -24.192.98.124 (talk) 05:36, 23 March 2008 (UTC)

I've added the bit about the doubt of Saddam's identity. One more bit I was tempted to edit: the "orange-and-white taxi" which was apparently found with Saddam. Should it be specified, for clarity's sake, that it wasn't in the spider hole? Zake 23:24, 15 Dec 2003 (UTC)

Wow, I cant believe no one that was actualy there has weighed in yet. I was there. Serving in C co. 1-22 Infanrty 4th Infantry Division. The article here is pretty accurate. I have talked to the Captain that was in command of the operation and thats pretty much how it all went down. In fact our company was on alert for 13 hours in case he wanted to fight like his sons. Also, the report about us keeping the news to our selves is true. We were not allowed to use the phones or internet (if we could find one) until after the announcement. Everyone who knew what had happened was ordered to keep it secret but becouse the soldiers knew that the only reason the we would be on alert for "Jackpot 1" was if they had Saddam cornered, and then the communications black out confirmed it. I dont know where that stuff about a rumor came from. 122regular

The nonsense below about conspiracy, staging, marines, etc. falls in line with those that also believe Neil Armstrong never walked on the moon and it is probably made of cheese. The version depicted here is accurate but special forces should read 'special operations forces.' Saddam was taken immediately by a small helicopter from the siteto his old palace complex in Tikrit until transferred to Baghdad that night. Very few people saw him, as he was in the small courtyard where the hole was and then covered up and walked out to the helicopter in a very short time. The comanders on the ground did not want to make a zoo out of him. He was hastily flown away to both secure him and allow for the process to notify President Bush before the news leaked. We were successful in that. I could not even tell my own troops involved in the operation that he had been captured, even though I knew it that night. Colonel Hickey's charge to his staff that was caught on film after the raid was for the same reason. We simply had to ensure that the national leadership learned the news first. Colonel Hickey gave strict orders to all of us in that regard and every one of his commanders accomplished that. The result was the electrifying news the next morning. It is absolutely foolish to believe anything other than Saddam being captured by a joint raid with special operations forces and the 1st Brigade, 4th Division. Steve Russell, Commander, 1st Battalion, 22nd Infantry, 1st Brigade, 4th Division, Tikrit, Iraq, 2003-2004.

We say that some folks theorise the captive might be a body double. My understanding is that a body double is an actor or actress whose body doubles for a more shy or less well-endowed lead (so that wasn't Julia Roberts' ass, it was Kathy Shower's). Given that it seems unlikely Saddam was planning on having any nudie pictures taken, I think this should just be a double. I didn't change it to double as that redirects to the poker term, nor to doppelganger, which is a terrible article (and not really correct anyway). Does anyone have any suggestion about where this should be directed? -- Finlay McWalter 01:04, 16 Dec 2003 (UTC)

 * I recommend the term "decoy". Currently there's nothing in Wikipedia for it, so we could link it in the paragraph where "body double" is now, and write a broad definition of decoy, giving Saddam Hussein as an example there. --Flockmeal 01:16, Dec 16, 2003 (UTC)

 * I wrote a very basic stub for Decoy that needs work, and have linked Decoy into this article, replacing body double. Please leave any suggestions or objections here on the Operation Red Dawn talk page, thanks.--Flockmeal 03:23, Dec 16, 2003 (UTC)

 * Super. Actually, I was wrong about double - the search-service auto jumps one to the poker term, but a link itself is red. -- Finlay McWalter 03:27, 16 Dec 2003 (UTC)

Why do we need to include paragraphs detailing absurd anonymous conspiracy allegations? Who has said these things? What credibility do they have? Does any ridiculous suggestion made by anonymous people merit inclusion in a serious encyclopaedia? There ought to be a minimum credibility threshhold before anything is included. Adam 05:52, 17 Dec 2003 (UTC)

I just wanted to say I thought this was a fine job by all concerned.

BTW, the latest rumor going out over Saudi mobile phones is that Saddam was captured a few months ago. They claim you can see ripe yellow date in the trees behind him in the photos.

Of course these folks think 4,000 Jews escaped the WTC.

Paul, in Saudi

I added a tidbit about the recent news that Saddam was actually captured by Kurds and provided a link from AP, which I think makes it valid.

ThaGrind 06:58, 22 Dec 2003 (UTC)

Abnormalities
This section leaves the reader hanging in the air a bit. Maybe I read too many Sherlock Holmes stories, but I would have thought that the dates thing was a smoking gun for the theory that the capture was staged to some extent. Hasn't anyone, anywhere tried to explain them? --Last Malthusian 10:48, 13 December 2005 (UTC)

[Note: I have been raising dates in the USA for 30+ years. It looks as though this palm is cultivated since there do not appear to be thorns on the fronds. It is possible that this one bunch was not pollinated. Palms send out their flowers over a period of time. If the pollination was too late for the first bunch (or to early for the last bunch) a whole bunch may not have been pollinated. This is not uncommon and would not be surprising in a war torn year. Unpollinated dates would still be yellow in Dec. They may not ever ripen or at best will turn color in Feb. or Mar. but never be good to eat. Since they are not palatable, they are often left on the palm and cleaned at the following year's dethorning when fruit stalks are removed. Any way, they will still be yellow in Dec. added 4/20/06 by Softmentor@aol.com]

Marines
Well, I checked the list of casualties and found no Marines died on 12 December 2003. That the capture was completed by an Army unit tends to discredit the claim of the alleged Marine. --Habap 21:46, 11 July 2006 (UTC)

Disputed section
I put this here so that it will be out of the article until it's ironed out :) WhisperToMe 06:53, 25 July 2006 (UTC)

Unexplained Discrepancies
There are numerous abnormalities and inconsistencies in the capture of Saddam Hussein. These have received little attention from the mainstream media.

A former U.S. Marine who claims he participated in capturing ousted Iraqi President Saddam Hussein said the public version of his capture was fabricated. "I was among the 20-man unit, including eight of Arab descent, who searched for Saddam for three days in the area of Dour near Tikrit, and we found him in a modest home in a small village and not in a hole as announced," Abou Rabeh said. "We captured him after fierce resistance during which a Marine of Sudanese origin was killed." No Marines were reported killed on that day, nor were Marine units involved in the action.

A special report on CNN shows what appears to be Col. Hickey explaining to his troops how Saddam was captured and ordering them to keep quiet about it www.prisonplanet.com/121803hickey.html].

Many are questioning why photos showing Saddam's "spider-hole" also show dates growing in the background. Dates in Iraq do not grow in December.

Many are also questioning why a man with such a massive amount of money, power and support would hide in an underground hole after having spent most of his adult life in palaces. This supports the belief that the American administration intended to portray Saddam as having lost all power and any will to fight, thus increasing American morale both at home and in Iraq.

Some also claim that the United States authorities timed Hussein's capture to divert attention from controversial actions by the Bush administration. Washington's Democratic Rep. Jim McDermott has suggested publicly that the Bush administration timed Hussein's capture to their own benefit. In a Fox News article, McDermott stated, "It's funny, when they're having all this trouble, suddenly they have to roll out something."

There were also press reports (which cite un-named British intelligence officers and Iraqi intelligence officers ) that American intelligence did not lead to the capture of Saddam, but rather that Saddam was betrayed by the Al-Jabour tribe and captured by Kurdish partisans. According to this story, the betrayal was revenge -- Saddam's son Uday had allegedly raped a woman belonging to the tribe -- and Saddam was turned over to the Kurdish Patriotic Front, who negotiated the ex-leader's handover to U.S. forces in return for a deal with the United States that would allow the party more power.

 * It'll be some time until the truth will be allowed to be revealed. But the question of whether this whole thing was staged, pure PR and propaganda is without question.

-G

Yvonne Ridley and the Taliban
The Controversy section currently starts:

'''Journalist Yvonne Ridley reported in Sunday Express that Saddam Hussein was actually captured by Kurdish forces who then drugged him and abandoned him for U.S. troops to find after brokering a deal. She was imprisoned for 10 days by the Taliban.'''

What? When was she imprisoned for 10 days by the Taliban? Did it have anything to do with her report, or any connection at all to the topic of this article, Operation Red Dawn?

203.143.238.33 08:02, 10 July 2007 (UTC)

Validity of this article
The entire wikipedia article chronicalling Operation Red Dawn and especially the reactions of other nations needs a great deal more sourcing. Either this webpage should be rewritten entirely, or deleted. As it is right now, it is all speculation and opinion.

Ulyssesm90 (talk) 17:12, 18 April 2008 (UTC)

 * 11 years later, it is still in the same state. Most of the unsourced reactions of individuals come from a single BBC article published shortly after the capture. They appear to be carefully curated and taken out of context, involving a very small number of global politicians. Additionally, many of those individuals quoted were involve in the invasion or most-closely supported the war. I can't find some of the quotes anywhere else on the web or other sources. Considering Britain's role in the invasion, the nature of the sourced article, and that some of the quotes directly contradict the respective nations' stances on the war (such as Chirac's), this overarching source is rather partisan in nature. For some of the other quotes that have linked sources, the sources don't contain the quotes. I agree, this is a strange article that needs a lot of fixing up. Saucysalsa30 (talk) 06:47, 15 December 2019 (UTC)

Why is Local and International Reaction so long?
Can someone explain why this section is so long and in depth? Can't this section be summarized and fulled explained elsewhere, such as "Reaction to Operation Red Dawn?" The same goes for the Trial of Saddam Hussein page.

Further, it creates problems in reading and understanding the "facts" regarding the Operation. The question you have to ask is, "would this be in an actual encyclopedia article? In this case, the answer is no.

I'd like to hear comments and further suggestions. If I don't hear to the contrary, I will change it myself. -- Jophus00 (talk) 22:21, 1 May 2008 (UTC)
 * I agree. Those things do not belong in the article on the operation itself. There needs to be a seperate article on reactions to the operation and its outcome, as the reactions are notable in a contemporary context. I don't edit WP anymore, but if you or someone else would be so kind as to just move and reformat those sections, that would greatly improve the quality of this article.

 * Also, I read the presentation of the quotes as being a bit biased. Mixing together quotes and analyses makes it harder to evaluate the neutrality of the presentation, so the quotes should go on WQ and the analyses should be sourced, not synthesized. That would be a logical next step after moving the reactions-section to a seperate article. 85.200.17.164 (talk) 19:46, 4 January 2011 (UTC)

Image copyright problem with Image:Bashar al-Assad on Charlie Rose.jpg
The image Image:Bashar al-Assad on Charlie Rose.jpg is used in this article under a claim of fair use, but it does not have an adequate explanation for why it meets the requirements for such images when used here. In particular, for each page the image is used on, it must have an explanation linking to that page which explains why it needs to be used on that page. Please check

 * That there is a non-free use rationale on the image's description page for the use in this article.
 * That this article is linked to from the image description page.

The following images also have this problem:

 * File:Anfal1988assyrianchurch.jpg

This is an automated notice by FairuseBot. For assistance on the image use policy, see Media copyright questions. --07:46, 15 May 2008 (UTC)

An image on this page may be deleted
This is an automated message regarding an image used on this page. The image File:Anfal1988assyrianchurch.jpg, found on Operation Red Dawn, has been nominated for deletion because it does not meet Wikipedia image policy. Please see the image description page for more details. If this message was sent in error (that is, the image is not up for deletion, or was left on the wrong talk page), please contact this bot's operator. STBotI (talk) 04:38, 31 December 2008 (UTC)

Books on the operation
Are there any books about the mission that can be used for this article?--Eaglestorm (talk) 02:57, 11 March 2010 (UTC)

U.S. military used social networking to capture Saddam
http://www.slate.com/id/2245228/ Sole Soul (talk) 08:19, 12 April 2010 (UTC)

Lack of content
Sorry but the article sucks. The title is "Operation Red Dawn," yet the section of the article titled "The Operation" is blank. --160.133.1.228 (talk) 18:18, 15 June 2011 (UTC)
 * Feel free to fix it, then. --Alan the Roving Ambassador (talk) 17:35, 21 June 2011 (UTC)
 * Based on content, this article would be more properly called "List of international reactions to Operation Red Dawn". ( Hohum  @ ) 18:35, 15 July 2011 (UTC)

$750,000 in cash and a checkered cab?
I've removed information that Hussein had 3/4s of a million dollars and a taxi in the spider hole with him. Certain arms were also mentioned:
 * Items confiscated during the raid include two AK-47 rifles, a pistol

which might be OK, but I couldn't find that information reflected in the given source. -- Kendrick7talk 00:52, 31 August 2014 (UTC)

Bold proposals
As many have remarked over many years, this article is not good. Here are some ideas to improve it. Feel free to insert comments after each point.
 * 1) Move article to Capture of Saddam Hussein. The subject is larger than the American military operation and more accurately called Capture of Saddam Hussein. I further propose to remove the Infobox military conflict. The picture should stay in the article however. Remove Campaignbox Iraq War, the bottom of the article contains 2003 Iraq war Operations and Iraq War (2003-2011).  - Mnnlaxer |  talk  | stalk 17:17, 30 December 2015 (UTC)
 * 2) Completely rewrite the lead. Besides shifting the focus of the first sentence to the capture and not the operation, where the name came from and a long sentence about what unit it was and who commanded the unit shouldn't be in the lead. Ditto naming two sites searched. Brief statements about Saddam going into hiding, the search for him, found in a spider hole, and what happened to him as a result of the capture are more appropriate. I would tackle this last, after the content of the article is improved.
 * 3) Background to the capture can be text about the Iraq invasion, Saddam disappearing, and discussion of his possible death from the bombing. Subsections can be the search for him and the location. - Mnnlaxer |  talk  | stalk 17:17, 30 December 2015 (UTC)
 * 4) Operation Red Dawn can be a section, although the current material needs sourcing. - Mnnlaxer |  talk  | stalk 17:17, 30 December 2015 (UTC)
 * 5) Done. Reactions are way too long and most are not relevant enough. I'll start cutting there now. - Mnnlaxer |  talk  | stalk 17:17, 30 December 2015 (UTC)
 * 6) Not sure what to do with the last two sections, but they need sourcing at a minimum. - Mnnlaxer |  talk  | stalk 17:17, 30 December 2015 (UTC)

Removed a lot of reactions. Waiting a for a bit for any feedback before moving the page. Added two articles for the basic facts at the time to be used in article, BBC and Guardian. They don't need to remain in External links. The Slate series should be used in the text and kept at External links. Added the Army history page to stay in External links and not be used in article. I don't think the FBI fingerprint image should stay. The capture photo can be used for the Operation Red Dawn section. - Mnnlaxer | talk  | stalk 17:06, 31 December 2015 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Operation Red Dawn. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20071016065201/http://thescotsman.scotsman.com/international.cfm?id=1377782003 to http://thescotsman.scotsman.com/international.cfm?id=1377782003

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 20:45, 10 December 2017 (UTC)

Was it the Kurds?
See:

https://www.smh.com.au/world/middle-east/we-got-him-kurds-say-they-caught-saddam-20031222-gdi11c.html

21:24, 4 October 2018 (UTC) — Preceding unsigned comment added by 92.22.35.178 (talk)

Requested move 12 December 2021

 * The following is a closed discussion of a requested move. Please do not modify it. Subsequent comments should be made in a new section on the talk page. Editors desiring to contest the closing decision should consider a move review after discussing it on the closer's talk page. No further edits should be made to this discussion.

The result of the move request was: moved. (closed by non-admin page mover) Extraordinary Writ (talk) 23:52, 19 December 2021 (UTC)

Operation Red Dawn → Capture of Saddam Hussein – Article title is currently ambiguous. Obvious application of principle of least astonishment. Readers seeking information about the apprehension of Hussein will at least expect a descriptive title. e.g. Killing of Osama bin Laden not Operation Neptune Spear. Schierbecker (talk) 12:11, 12 December 2021 (UTC)
 * Support per WP:RECOGNIZABLE. - Station1 (talk) 19:37, 12 December 2021 (UTC)
 * Support For obvious clarity. Abhishek0831996 (talk) 16:42, 13 December 2021 (UTC)
 * Oppose per WP:AT. The current title is not ambiguous or astonishing, or unclear. No other "Operation Red Dawn"s are mentioned in the article or elsewhere. Anyone searching "operation red dawn" would expect this article and be astonished to find anything else. And as a title, it's quite clear - the operation name does quite clearly apply to the subject matter as written. The current title is reasonably well represented in reliable sources, and it fits all the WP:AT criteria. No need to change. Btw - is this a LearnedLeague-influenced RM, I just wonder? Dohn joe (talk) 20:22, 13 December 2021 (UTC)
 * 'Support, it is certainly more clear and recognizable. Walrasiad (talk) 12:37, 15 December 2021 (UTC)

Contradictory Information
The account of Saddam's capture given in the article differs from the account given by the study group in the book "The US army in the Iraq war." It sates the following:

During their initial search of the farmhouse and surrounding palm groves, the Soldiers found two AK47s and $750,000 in cash. (Page 238 in the book, page 279 in the pdf)

This is contrary to the wiki article, which states that the cash and rifle was found in the hole. The wiki article also doesnt mention the second AK 47. I did some google searching and found some articles mentioning the second rifle:

https://www.cnn.com/2003/WORLD/meast/12/14/sprj.irq.saddam.operation/

https://abcnews.go.com/International/story?id=79346&page=1

https://www.nytimes.com/2003/12/15/world/capture-hussein-ex-dictator-hussein-caught-makeshift-hide-bush-says-dark-era-for.html

https://smallwarsjournal.com/jrnl/art/intelligence-planning-and-methods-employed-operation-red-dawn-the-capture-of-saddam-hussein

The chapter end notes in "The US army in the Iraq war" source this book by Steve Russel, who apparently served in Iraq according to his wikipage.

Thoughts? Super Spaghetti Theory (talk) 21:36, 7 August 2023 (UTC)

Coordinates?
Where exactly was he captured? Based on (unreliable source, user contrib), it's 34°28'22.3"N 43°46'53.7"E. Some contemporary pictures here (reliable source); the road looks similar. Some maps here (I think reliable source?); appears to line up with the first unreliable source's coordinates.

I'm going to add the coordinates with the refs but feel free to undo and discuss if disagree. 104.232.119.107 (talk) 11:03, 7 April 2024 (UTC)

title: Talk:Capture of Saddam Hussein


text:
Danish People's Party

The Danish People's Party (Dansk Folkeparti, DF; or sometimes in DPP) is a nationalist and right-wing populist political party in Denmark. It was formed in 1995 by former members of the Progress Party (FrP).

The party saw a period of significant growth after its founding and lent its support to the Venstre–Conservative People's Party coalition government that ruled from the general election of 2001 until the 2011 election defeat. While not part of the cabinet, DF cooperated closely with the governing coalition on most issues and received support for key political stances in return, to the point that the government was commonly referred to as the "VKO-government" (O being DF's election symbol). It also provided parliamentary support to Lars Løkke Rasmussen's cabinets from 2016 to 2019, again without participating in it. In the 2014 European Parliament election in Denmark, DF secured 27% of the vote as part of the European Conservatives and Reformists group. This was followed by receiving 21% of the vote in the 2015 general election, becoming the second largest party in Denmark for the first time.

However, since 2015, the party has since seen a decline in support, falling to 3rd place and 10.8% of the vote in the 2019 European Parliament election in Denmark, and to just 8.7% in the 2019 Danish general election, resulting in a loss of 21 seats and a return to opposition. The party would later lose over half of its seats in the 2021 Danish local elections, losing 130 of the 221 it held before the election, achieving just 4.1% of the vote. Some commentators attributed the losses to internal conditions within the party and conflicts with the leadership, its perceived indecisiveness in government and rival parties adopting many of its policy ideas. The DF would also suffer a number of defections during 2022 following the rise of the Denmark Democrats party which many former DF members and supporters joined. It would receive its worst general election result ever in 2022, when it only won five seats. , due to defections from Nye Borgerlige, DF now has seven of the seats in the Danish Folketing.

History
The party's popularity has grown since its inception, taking 25 seats in the 179-member Folketing in the 2007 parliamentary election (13.8% of the vote, remaining the third largest party in Denmark). In the 2011 parliamentary election, while maintaining its position as the third largest party, DF received 12.3% of the vote, marking its first electoral decline.

Early years (1995–2001)
The Danish People's Party was founded on 6 October 1995, after Pia Kjærsgaard, Kristian Thulesen Dahl, broke out from the Progress Party. Its first national convention was held in Vissenbjerg on 1 June 1996, where Pia Kjærsgaard was unanimously elected as the party's chairman. The party was established in protest over the "anarchistic conditions" of the Progress Party, and its "all or nothing" policies. It was initially seen by many as a "clone" of the Progress Party, but this was soon proved false. In a struggle to be respected as a responsible party able to cooperate with others and distance it from the conditions in the Progress Party, the leadership of the party struck down criticism from its members by means of expulsions. The party saw a highly centralized party leadership as necessary, as it would not tolerate internal conflicts and disagreements with the official strategy.

The party was the first successful parliamentary party in the Nordic countries to relate philosophically more closely to the French Nouvelle Droite, than to the previous Nordic form of right-wing populism. DF represented a synthesis of several political currents: the Lutheran movement Tidehverv and its related journal, an intellectual nationalist right from the Danish Association (Den Danske Forening) and conservative populists from the Progress Party.

In 1997, the party won about 7% in the municipal elections, and did very well in traditional left-wing municipalities, potentially rivaling the Social Democrats. By 1998, the party had 2,500 registered members. The party made its electoral debut in the 1998 Danish parliamentary election, winning 13 seats and 7.4% of the vote. The party was, however, left with no influence in the formation of a government; it was shut out in large part due to the perception that it was not stuerent (i.e. not acceptable or "housebroken").

Venstre-Conservative coalitions (2001–2011)
In the 2001 election, the party won 12% of the vote and 22 seats in parliament. It became the third largest party in the parliament, giving them a key position, as they would have a parliamentary majority together with the Conservative People's Party and Venstre. DF was favoured by these parties, as it had supported the Venstre candidate for Prime Minister, Anders Fogh Rasmussen, during the election campaign. Eventually, it gave its parliamentary support for a Venstre-Conservative coalition government, headed by Prime Minister Rasmussen, in exchange for the implementation of some of their key demands, first and foremost stricter policies on immigration. The party had a key role in writing the rules and conditions for immigration in the immigration law that was established by the government in May 2002, which it called "Europe's strictest".

In the 2005 election, the party further increased their vote, and won 13.2% of the vote and 24 seats. With young first-time voters the party was even more popular, receiving one fifth of their votes. The party continued to support the government, and developed a broader policy base, as it made welfare policies its core issue, together with immigration policies.

In 2006, the party's popularity rose dramatically in opinion polls following the Jyllands-Posten Muhammad cartoons controversy, at the expense of the Social Democrats. The average of all monthly national polls showed DF gaining seven seats in parliament from January to February, with the Social Democrats losing an equal number. This effect, however, somewhat waned with the falling media attention to the cartoons controversy.

In the 2007 parliamentary election, DF won 13.9% and 25 seats, and again continued to support the Conservative-Liberal government. Thus, in every election since its founding the party has had a steady growth, although the growth rate has stagnated somewhat in recent years. Parties in the political centre, particularly the newly founded New Alliance had sought to become the kingmaker and be able to isolate the immigration policies of DF, but eventually failed. The party was a member of the Movement for a Europe of Liberties and Democracy (MELD).

In the 2009 elections for the European Parliament, the prime candidate for the party, Morten Messerschmidt, won his seat in a landslide with 284,500 personal votes (most votes for any single candidate by any party); thus giving the party a second seat (which went to Anna Rosbach Andersen). The party made a breakthrough from its previous results in European elections, more than doubling its vote to 15.3%, and receiving 2 MEPs.

On 15 September 2012, Kristian Thuesen Dahl succeeded Kjærsgaard as chairman.

Thulesen Dahl leadership (2012–2022)
During the 2015 election the DF won 21.08% of the national vote under the leadership of Kristian Thulesen Dahl, the highest since its founding and gained 37 seats putting the party in second place. In the aftermath, the party entered negotiations with Venstre to again provide parliamentary support in return for stricter policies on immigration and the EU. A minority government headed by Lars Løkke Rasmussen was subsequently formed with the DF, the Liberal Alliance and the Conservative People's Party providing support.

The party suffered a major defeat in the 2019 election, recording its worst result since 1998. It won just 8.7% of the vote and 16 seats, a net loss of 21 seats since 2015; it fell to third place, just narrowly outpolling the Social Liberals. Some journalists and political commentators opined that the DF's loss in support was as a result of the party's refusal and indecisiveness on taking direct part in government and the main parties including the Social Democrats adopting many of the DF's policies on immigration and integration.

In January 2022, Dahl stood down as leader and was replaced by Morten Messerschmidt in a leadership election where he won 499 out of the 828 delegators' votes against two other candidates. After Messerschmidt a total of 11 out of 16 MPs had in June left the party including Thuelsen Dahl who was the only one of them who passed on his seat to the next in line.

Messerschmidt leadership (2022–present)
At the 2022 election, the party suffered its worst election result ever with 2.6% of the vote, equal to 5 seats. In December 2022, Morten Messerschmidt was acquitted of all charges related to prior allegations of misuse of EU funds according to several political analysts and commentators, paving the way for a restoration of the party. During January and February 2023, Mikkel Bjørn and Mette Thiesen, who were both elected for Nye Borgerlige, joined the Danish People's Party, increasing its seat count to seven.

Policies
DF is a nationalist and right-wing populist party. It is positioned on the right-wing to far-right  of the political spectrum. The DF's stated goals are to protect the freedom and cultural heritage of the Danish people, including the family, the monarchy and the Evangelical Lutheran Church of Denmark, to enforce a strict rule of law, to work against Denmark becoming a multi-cultural society by limiting immigration and promoting cultural assimilation of admitted immigrants, to maintain a strong welfare system for those in need, and to promote entrepreneurship and economic growth by strengthening education and encouraging people to work, to protect the environment and natural resources, and to protect Danish sovereignty against the European Union. In comparison to its predecessor, the Progress Party, the DF focuses more on immigration, while at the same time being more pragmatic on other topics. While overall considered part of the radical right, its policies on most economic issues would rather place the party in the centre to centre-left. The party's former leader, Kristian Thulesen Dahl, once declared DF an anti-Muslim party.

Immigration
DF is opposed to immigration. The party holds that Denmark is not naturally a country of immigration. The party also does not accept a multi-ethnic transformation of Denmark, and rejects multiculturalism. Former party leader Pia Kjærsgaard stated she did "not want Denmark as a multiethnic, multicultural society", and that a multiethnic Denmark would be a "national disaster". The party seeks to drastically reduce non-Western immigration and favors cultural assimilation of immigrants from all religions. In 2010, the party proposed to put a complete stop to all immigration from non-Western countries, a continuation of a proposal the month before to toughen the 24-year rule. They do, however, make the distinction between immigrants, those who intend to stay in Denmark permanently, and refugees, those that will only be in Denmark for the duration of the conflict, but ultimately intend to return home. The party has stated that it is more than happy to help those in need, but have a moral responsibility to the people of Denmark to keep Denmark Danish.

Cooperation with the Conservative-Liberal coalition government resulted in the implementation of some of their key demands, most importantly strong restrictions in immigration policies, which have resulted in what is often described as Europe's strictest immigration laws. The new government enacted rules that prevented Danish citizens and others from bringing a foreign spouse into the country unless both partners were aged 24 or above, passed a solvency test showing the Dane had not claimed social security for 12 months, and could lodge a bond of 60,011 kroner (about US$10,100). One declared aim of this was to fight arranged marriages. These new rules had the effect that while about 8,151 family reunification permits were granted in 2002, the number had fallen to 3,525 by 2005. Some social benefits for refugees were also cut by 30-40% during their first seven years in power. Ordinary unemployment benefits were replaced by a reduced "start-up aid". Whereas the government coalition's declared aim with this was to improve integration by inciting people to work, immigration spokesman Søren Krarup of DF has expressed his content in that the start-up aid has decreased the number of economic refugees greatly, showing them that "one does not find gold on the street, as has been told out in the third world". Nevertheless, total immigration increased post implementation of the migration reforms.

Other domestic
The party wants to improve conditions for the elderly and disabled, and advocates stricter punishments for crimes such as rape, violence, sexual abuse, reckless driving, and cruelty to animals. It supports grants for specific research into terrorism, Islamism, and Cold War history as well as increased defense spending. It also wants to maintain the Danish monarchy and the current Danish constitution, and to abolish the 'hate speech' clause in the Danish criminal code.

Economy
The party is considered to be the first pure example of a radical right-wing populist (RRP) party in Denmark; as such the party was described as the "pioneer of welfare chauvinism". According to Scandinavian Political Studies, the success of the party in the 2015 election was not based only on its hardline stance towards immigration, but also its support for pro-welfare, redistributive policies that voters considered highly neglected by the Social Democrats. This made "economic insecurity, marginalization, regional core–periphery divides" the decisive factors of the 2015 election. In the 2019 Danish general election, Social Democrats were then able to regain voters they lost to Danish People's Party by sharply turning left on welfare and redistribution, as well as shifting right on social issues by adopting "left-conservative" stances. DPP was therefore classified as economically left and socially right-wing, as it shares its voter base with a “left conservative” social democratic party, which Social Democrats became between 2015 and 2019.

Despite its right-wing orientation, Danish People's Party stands is left of center on the issues of economic and welfare, favouring staunchly left-wing policies towards the elderly. However, the party also has a strong welfare chauvinist policy, and has some conservative inclinations on income benefits. While the populist nature of the party could make its program appear blurry and constantly oscillating between the economic centre and economic left, its economic stance is much closer to Social Democrats and the Socialist People's Party than the centre-left Danish Social Liberal Party. DPP largely tried to imitate the traditionally left-wing economic policies; this made DPP a "working-class party" that was able to attract manual workers at odds with the stance of left-wing Danish parties on socio-cultural issues. Prior to 2015, these voters would still vote for traditional left-wing parties as long as they identified with their economic positions and saw them as defenders of the working class.

Norwegian political scientist Anders Ravik Jupskås described Danish People's Party as a unique right-wing populist party that appeals to "authoritarian working class" and presents a platform that is "a combination of left-wing economics and nativist immigration policies". The party described itself as the "true defender of the Danish welfare state" and campaigned on excluding immigrants from the Danish welfare state as the best way to protect it. However, the party also spoke in favour of increasing spending for Danish pensions and healthcare, and it was found that the party's voteres "most unanimously favour increasing expenditures, even in comparison with social democrats and left wing voters". The party warned against the creeping market liberalisation and attacked neoliberalism and globalization on both economic and social perspectives, which allowed it to make inroads with working-class voters. The party also promised to empower trade unions and entered cooperation agreements with minor unions and workers' associations.

Under Messerschmidt's leadership, the party has moved in a more economic liberal direction, advocating tax cuts.

Foreign
The party opposes a cession of Denmark's sovereignty to the European Union and opposes further EU integration and Eurofederalism. It also opposes the Euro currency and wants to maintain the Danish krone. It is also against the potential accession of Turkey to the European Union. DF is Eurosceptic.

The party initially voted in favour of the 2003 invasion of Iraq, but in 2014, the foreign affairs spokesman Søren Espersen said this support had been mistaken and that the rule of former dictator Saddam Hussein was "far preferable" to the events that followed. He claimed the party had "blindly followed" Prime Minister Anders Fogh Rasmussen at the time of the invasion.

The party supported Danish enforcement of a no-fly zone during the 2011 military intervention in Libya, but was initially sceptical of proposals for direct Danish military involvement. The party later supported the decision out of solidarity with NATO. The party leadership subsequently supported extending the Danish mission in Libya, despite the disagreement of its defense spokesman Ib Poulsen. Three years after the intervention, foreign affairs spokesman Espersen stated the party's support for the intervention was a "mistake" and predicated on a misunderstanding of the ideology of the Libyan rebels.

The party supported Danish participation in France's Operation Serval against Islamist fighters in Mali. However, it opposed proposals for Danish involvement in the Syrian Civil War. The party seeks international recognition of Taiwan and supports Taiwan in its disputes with the People's Republic of China. In 2007, the party opposed the Danish government's plan to recognise the independence of Kosovo, and maintained the territorial integrity of Serbia. The DF is supportive of Israel and opposes the recognition of Palestine on the grounds that there is no effective Palestinian state, and wants to move the Danish embassy in Israel to Jerusalem. The DF also supports Danish membership of NATO. Although the party supports Ukraine in the Russo-Ukrainian War, it has stated that its support has an "expiration date", and expressed opposition to Ukrainian EU membership, criticising the Ukrainian government's approach to rule of law.

Analysis of vote

 * An analysis by the trade union SiD after the 2001 election stated that among unskilled workers aged under 40, 30% voted for DF and only 25% for the Social Democrats.
 * Decreased importance of "economic cleavage": Several authors believe that the political "cleavages" of European societies have changed over recent decades Contemporary Western European democracies are characterized by two major cleavage dimensions: the economic cleavage dimension, which pits workers against the capital, and which concerns the degree of state involvement in the economy, and the socio-cultural cleavage dimension.
 * Referendums brought the rejection of the Maastricht Treaty and the Euro. The DF has managed to harness this scepticism more effectively than others.

One feature, compared to other Danish parties, is that the Danish People's Party is usually underrepresented by about 1-1.5% in opinion polls. Election researchers have suggested that the party's voters may be less interested in politics, and therefore declining to talk to pollsters, or that voters are reluctant to reveal their support for the party to pollsters.

Leaders
The party has had the following leaders since its foundation:

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Danish People's Party


text:
List of health departments and ministries

Most executive governments in the world are divided into departments or ministries. In most such cases, there is a department or ministry responsible for health.

A

 * 🇦🇫 Ministry of Public Health (Afghanistan)
 * 🇦🇱 Ministry of Health and Social Protection (Albania)
 * 🇩🇿 Ministry of Health, Population and Hospital Reform (Algeria)
 * 🇦🇬 Ministry of Health and the Environment (Antigua and Barbuda)
 * Barbuda's Public Health Department
 * 🇦🇷 Ministry of Health (Argentina)
 * 🇦🇲 Ministry of Health (Armenia)
 * 🇦🇺 Department of Health and Aged Care (Australia)
 * Ministry of Health (New South Wales), known as NSW Health
 * Department of Health & Human Services (Victoria)
 * Department of Health (Western Australia)
 * 🇦🇹 Ministry of Social Affairs, Health, Care and Consumer Protection (Austria)
 * 🇦🇿 Ministry of Healthcare (Azerbaijan)

B

 * 🇧🇩 Ministry of Health and Family Welfare (Bangladesh)
 * 🇧🇸 Ministry of Health (The Bahamas)
 * 🇧🇭 Ministry of Health (Bahrain)
 * 🇧🇪 Federal Public Service Health (Belgium)
 * Department of Welfare, Public Health and Family (Flanders)
 * 🇧🇹 Ministry of Health (Bhutan)
 * 🇧🇼 Ministry of Health and Wellness (Botswana)
 * 🇧🇷 Ministry of Health (Brazil) (Ministério da Saúde)
 * Ministry of Health (Brunei) (Kementerian Kesihatan)

 * return to table of contents

C

 * 🇰🇭 Ministry of Health (Cambodia)
 * 🇨🇦 Health Canada
 * Ministry of Health (Alberta)
 * Ministry of Health (British Columbia)
 * Department of Health (New Brunswick)
 * Ministry of Health (Ontario)
 * Ministry of Health and Social Services (Quebec)
 * Ministry of Health (Saskatchewan)
 * 🇨🇱 Ministry of Health (Chile) (Ministerio de Salud de Chile) and Fondo Nacional de Salud (FONASA)
 * 🇨🇳 National Health Commission
 * 🇨🇴 Ministry of Health and Social Protection (Colombia)
 * Ministry of Public Health (Democratic Republic of the Congo)
 * 🇨🇷 Costa Rican Social Security Fund
 * 🇨🇮 Ministry of Health and the Fight against AIDS (Côte d'Ivoire)
 * 🇭🇷 Ministry of Health (Croatia)
 * 🇨🇾 Ministry of Health (Cyprus)
 * 🇨🇿 Ministry of Health (Czech Republic)

 * return to table of contents

D

 * 🇩🇰 Ministry of Health (Denmark)

 * return to table of contents

E

 * Ministry of Health (East Timor)
 * 🇪🇬 Ministry of Health and Population (Egypt)
 * 🇪🇹 Ministry of Health (Ethiopia)

 * return to table of contents

F

 * 🇫🇯 Ministry of Health and Medical Services (Fiji)
 * 🇫🇮 Ministry of Social Affairs and Health (Finland)
 * 🇫🇷 Ministry for Solidarity and Health (France)
 * return to table of contents

G

 * Ministry of Health, Labour and Social Affairs of Georgia
 * 🇩🇪 Federal Ministry of Health (Germany)
 * 🇬🇭 Ministry of Health (Ghana)
 * 🇬🇷 Ministry of Health (Greece)
 * 🇬🇳 Ministry of Health (Guinea)
 * 🇬🇼 Ministry of Public Health (Guinea-Bissau)

 * return to table of contents

H

 * Ministry of Health (Haiti)
 * 🇭🇰 Food and Health Bureau
 * Department of Health (Hong Kong)

 * return to table of contents

I

 * 🇮🇸 Ministry of Welfare (Iceland)
 * 🇮🇳 Ministry of Health and Family Welfare (India)
 * Ministry of Public Health (Maharashtra)
 * Department of Health and Family Welfare (Tamil Nadu)
 * Ministry of Health & Family Welfare (Tripura)
 * Ministry of Health & Family Welfare (West Bengal)
 * 🇮🇩 Ministry of Health (Indonesia) (Kementerian Kesehatan)
 * 🇮🇷 Ministry of Health and Medical Education (Iran)
 * 🇮🇶 Ministry of Health (Iraq)
 * 🇮🇪 Department of Health (Ireland)
 * 🇮🇱 Ministry of Health (Israel)
 * 🇮🇹 Ministry of Health (Italy)

 * return to table of contents

J

 * 🇯🇵 Ministry of Health, Labour and Welfare, Japan
 * 🇯🇴 Ministry of Health (Jordan)

 * return to table of contents

K

 * 🇰🇿 Ministry of Healthcare (Kazakhstan)
 * 🇰🇪 Ministry of Health (Kenya)
 * 🇰🇮 Ministry of Health and Medical Services (Kiribati)
 * 🇰🇼 Ministry of Health (Kuwait)

 * return to table of contents

L

 * Ministry of Health (Laos)
 * 🇱🇧 Ministry of Public Health (Lebanon)
 * 🇱🇷 Ministry of Health and Social Welfare, Liberia
 * 🇱🇹 Ministry of Health (Lithuania)

 * return to table of contents

M

 * Secretariat for Social Affairs and Culture (Macau)
 * 🇲🇱 Ministry of Public Health and Hygiene (Mali)
 * 🇲🇹 Ministry for Health (Malta)
 * 🇲🇽 Secretariat of Health (Mexico)
 * 🇲🇾 Ministry of Health (Malaysia)
 * 🇲🇩 Ministry of Health (Moldova)
 * 🇲🇪 Ministry of Health (Montenegro)
 * 🇲🇦 Ministry of Health (Morocco)
 * 🇲🇲 Ministry of Health (Myanmar)

 * return to table of contents

N

 * 🇳🇵 Ministry of Health and Population (Nepal)
 * 🇳🇱 Ministry of Health, Welfare and Sport (Netherlands)
 * 🇳🇿 Ministry of Health (New Zealand)
 * 🇳🇬 Federal Ministry of Health (Nigeria)
 * Akwa Ibom State Ministry of Health
 * Lagos State Ministry of Health
 * Rivers State Ministry of Health
 * 🇰🇵 Ministry of Public Health (North Korea)
 * 🇳🇴 Ministry of Health and Care Services (Norway)

 * return to table of contents

P

 * 🇵🇰 Ministry of National Health Services, Regulation and Coordination (Pakistan)
 * Sindh Health Department
 * Ministry of Health, Palestine
 * 🇵🇦 Ministry of Health (Panama)
 * 🇵🇬 National Department of Health of Papua New Guinea
 * 🇵🇪 Ministry of Health (Peru)
 * 🇵🇭 Department of Health (Philippines)
 * Ministry of Health (Bangsamoro)
 * 🇵🇱 Ministry of Health (Poland)
 * 🇵🇹 Ministry of Health (Portugal)

 * return to table of contents

R

 * 🇷🇴 Ministry of Health (Romania)
 * 🇷🇺 Ministry of Health (Russia)
 * Ministry of Health (Bashkortostan)
 * 🇷🇼 Ministry of Health (Rwanda)

 * return to table of contents

S

 * 🇸🇦 Ministry of Health (Saudi Arabia)
 * 🇷🇸 Ministry of Health (Serbia)
 * 🇸🇱 Ministry of Health and Sanitation (Sierra Leone)
 * 🇸🇬 Ministry of Health (Singapore)
 * 🇸🇧 Ministry of Health and Medical Services (Solomon Islands)
 * 🇸🇴 Ministry of Health (Somalia)
 * Ministry of Health (Somaliland)
 * 🇿🇦 Department of Health (South Africa)
 * Western Cape Department of Health
 * 🇰🇷 Ministry of Health and Welfare (South Korea)
 * 🇸🇸 Ministry of Health (South Sudan)
 * 🇪🇸 Ministry of Health (Spain)
 * Department of Health (Basque Country)
 * 🇱🇰 Ministry of Health (Sri Lanka)
 * 🇸🇪 Ministry of Health and Social Affairs (Sweden)
 * Ministry of Health (Syria)

 * return to table of contents

T

 * 🇹🇼 Ministry of Health and Welfare (Taiwan)
 * 🇹🇯 Ministry of Health (Tajikistan)
 * 🇹🇿 Ministry of Health and Social Welfare (Tanzania)
 * 🇹🇭 Ministry of Public Health (Thailand)
 * 🇹🇹 Ministry of Health (Trinidad and Tobago)
 * 🇹🇷 Ministry of Health (Turkey)
 * 🇹🇲 Ministry of Health (Turkmenistan)

 * return to table of contents

U

 * 🇺🇬 Ministry of Health (Uganda)
 * 🇺🇦 Ministry of Healthcare (Ukraine)
 * Ministry of Health (United Arab Emirates)
 * Department of Health (Abu Dhabi)
 * Dubai Health Authority
 * United Kingdom
 * 🏴 Department of Health and Social Care covers England and any undevolved matters
 * Department of Health (Northern Ireland) (Northern Ireland)
 * 🏴 Health and Social Care Directorates (Scotland)
 * 🏴 Department of Health and Social Services (Wales)
 * 🇺🇸 United States Department of Health and Human Services (All U.S. states and territories have a state health agency.)
 * Alabama Department of Public Health
 * Alaska Department of Health and Social Services
 * Arizona Department of Health Services
 * Arkansas Department of Health
 * California Department of Public Health
 * Florida Department of Health
 * Hawaii Department of Health
 * Illinois Department of Public Health and Illinois Department of Healthcare and Family Services
 * Louisiana Department of Health and Hospitals
 * Maryland Department of Health and Mental Hygiene
 * Massachusetts Department of Public Health
 * Michigan Department of Health and Human Services
 * Nebraska Department of Health & Human Services
 * Nevada Department of Health and Human Services
 * New Hampshire Department of Health & Human Services
 * New Jersey Department of Health and Senior Services
 * New Mexico Department of Health
 * New York State Department of Health
 * North Carolina Department of Health and Human Services
 * Oklahoma State Department of Health
 * Oregon Health Authority
 * Pennsylvania Department of Health
 * Rhode Island Department of Health
 * South Carolina Department of Health and Environmental Control
 * Texas Department of State Health Services
 * Utah Department of Health
 * Virginia Department of Health
 * Washington State Department of Health
 * Wisconsin Department of Health Services
 * Wyoming Department of Health
 * 🇵🇷 Puerto Rico Department of Health (U.S. territory)
 * Ministry of Public Health (Uruguay)
 * Ministry of Public Health (Uzbekistan)

 * return to table of contents

V

 * Ministry of Health (Vietnam)

 * return to table of contents

Y

 * 🇾🇪 Ministry of Public Health and Population

Z

 * 🇿🇲 Ministry of Health (Zambia)
 * 🇿🇼 Ministry of Health and Child Welfare (Zimbabwe)

 * return to table of contents

Former health ministries or departments

 * 🇨🇳 Ministry of Health of the People's Republic of China
 * 🇨🇴 Ministry of Social Protection (Colombia)
 * 🇩🇰 Ministry of Interior and Health (Denmark)
 * Ministry of Health (Rhodesia)
 * Ministry of Health (Soviet Union)

 * return to table of contents

International bodies

 * World Health Organization

 * return to table of contents


text:
Basset horn

The basset horn (sometimes hyphenated as basset-horn) is a member of the clarinet family of musical instruments.

Construction and tone
Like the clarinet, the instrument is a wind instrument with a single reed and a cylindrical bore. However, the basset horn is larger and has a bend or a kink between the mouthpiece and the upper joint (older instruments are typically curved or bent in the middle), and while the clarinet is typically a transposing instrument in B♭ or A (meaning a written C sounds as a B♭ or A), the basset horn is typically in F (less often in G). Finally, the basset horn has additional keys for an extended range down to written C, which sounds F at the bottom of the bass staff. In comparison, the alto clarinet typically extends down to written E♭, which sounds G♭, one semitone higher than the basset horn. The timbre of the basset horn is similar to the alto clarinet's, but darker. Basset horns in A, G, E, E♭, and D were also made; the first of these is closely related to the basset clarinet.

The basset horn is not related to the horn, or other members of the brasswind family (Sachs-Hornbostel classification 423.121.2 or 423.23); it does, however, bear a distant relationship to the hornpipe and cor anglais. Its name probably derives from the resemblance of early, curved versions to the horn of some animal.

Some of the earliest basset horns, which are believed to date from the 1760s, bear an inscription "ANT et MICH MAYRHOFER INVEN. & ELABOR. PASSAVII", which has been interpreted to mean they were made by Anton and Michael Mayrhofer of Passau.

Modern basset horns can be divided into three basic types, distinguished primarily by bore size and, consequently, the mouthpieces with which they are played:

 * The small-bore basset horn has a bore diameter in the range of 15.5 to(-) (still somewhat larger than a soprano clarinet bore, though it is often erroneously thought to be the same; even a large bore English clarinet, such as the old B&H 1010 design has a smaller bore of 15.3 mm). It is played with a B♭/A clarinet mouthpiece. Only the Selmer Company (Paris) and Stephen Fox (Canada) currently make this model.
 * The medium-bore basset horn has a bore diameter in the region of 17.0 mm or slightly less. This is the most common type made by German-system manufacturers (e.g., Otmar Hammerschmidt (Austria)). Since no French-style mouthpiece with an appropriate bore is mass-produced, this model requires a matching German basset-horn mouthpiece. (This model is not usually recognized in North America, where it is confused with the large-bore type described below.) Stephen Fox currently makes this model also.
 * The large-bore basset horn, with a bore diameter of about 18.0 mm and played with an alto-clarinet mouthpiece, is in constructional terms an alto clarinet pitched in F and with the extra basset notes. The Leblanc basset horns (bores about 18.0 to(-)) are of this type.

The current Buffet basset horn could be called a hybrid "medium-large bore" model, since it uses an alto-clarinet mouthpiece but has a bore diameter around 17.2 mm.

Repertoire
A number of composers of the classical period wrote for the basset horn, and the famous 18th-century clarinettist Anton Stadler, as well as his younger brother Johann, played it. Wolfgang Amadeus Mozart was by far the most notable composer for the basset horn, including three basset horns in the Maurerische Trauermusik (Masonic Funeral Music), K. 477, and two in both the Gran Partita, K. 361, and the Requiem, K. 626, and several of his operas, such as Die Entführung aus dem Serail, La Clemenza di Tito which features Vitellia's great aria "Non più di fiori" with basset-horn obbligato, and Die Zauberflöte, where they prominently accompany the March of the Priests, as well as chamber works. He wrote dozens of pieces for basset horn ensembles. (His Clarinet Concerto in A Major, KV 622, however, appears originally to have been written for a clarinet with an extended lower range, a basset clarinet in A, though there is an earlier version of part of the first movement, KV 621b in the Köchel catalogue of Mozart's works, scored for G basset horn and pitched a major second lower, in the key of G major.) The Clarinet Quintet in A major (K. 581) has also been performed on basset horn by Teddy Ezra with other members of the Else Ensemble.

Other early works for basset horn include a concerto for basset horn in G and small orchestra by Carl Stamitz, which has been arranged for conventional basset horn in F (it has been recorded on this instrument by Sabine Meyer), and a concerto in F by Heinrich Backofen.

In the 19th century Felix Mendelssohn wrote two pieces for basset horn, clarinet, and piano (opus 113 and 114). These were later scored for string orchestra. Franz Danzi wrote a Sonata in F, for basset horn and piano, Op. 62 (1824) Antonín Dvořák attempted a half-hearted revival, using the instrument in his Czech Suite (1879), in which he specifies that an English horn (cor anglais) may be used instead, but the instrument was largely abandoned until Richard Strauss took it up once more in his operas Elektra (1909), Der Rosenkavalier, Die Frau ohne Schatten, Daphne, Die Liebe der Danae, and Capriccio, and several later works, including two wind sonatinas (Happy Workshop and Invalid's Workshop). Franz Schreker also employed the instrument in a few works including the operas Die Gezeichneten and Irrelohe. Roger Sessions included a basset horn in the orchestra of his Violin Concerto (1935), where it opens the slow movement in a lengthy duet with the solo violin. In the last quarter of the 20th century and first decade of the 21st, Karlheinz Stockhausen wrote extensively for basset horn, giving it a prominent place in his cycle of operas Licht and other pieces.

Other works

 * "Dreams and Prayers of Isaac the Blind" for solo clarinetist (soprano clarinets, basset horn, and bass clarinet) and string quartet by Osvaldo Golijov; later arranged for solo clarinetist and string orchestra.
 * Serenade on Carl Maria von Weber's Oberon for basset horn and two guitars, op. 28, written by Heinrich Neumann.
 * Etudes for Piano and Orchestra, Op. 39 (1992) by Peter Schat calls for 3 basset horns in the orchestra.
 * Serenade for 12 Instruments, Op. 61b (1915) by Josef Holbrooke calls for both corni di bassetto and oboe d'amore.
 * Alessandro Rolla – Concerto in F Major BI. 528 for basset horn and orchestra
 * Bertold Hummel – Concertino for basset horn and strings Op. 27a (1964)
 * George Benjamin's first opera Into the Little Hill
 * In his enormous Gothic Symphony Havergal Brian enlists two basset horns.
 * Samuel Andreyev - La pendule de profil for basset horn, bassoon, viola, cello and double bass
 * Michael Schneider - Licht bei Vermeer for basset horn, vibraphone and 8 voices
 * Howard J. Buss - "In Memoriam" for basset horn and piano (2015)

Basset horn soloists and ensembles
The Lotz Trio performs on replicas of the basset-horns made by the 18th-century instrument maker Theodor Lotz of Pressburg (Bratislava) and Vienna. The ensemble presents a repertoire of popular 18th-century wind harmonias (known in German as Harmoniemusik) represented predominantly by Mozart's music. However, the ensemble also performs music by other central-European composers – Georg Druschetzky, Martín I Soler, Anton Stadler, Vojtech Nudera, Johann Josef Rösler and Anton Wolanek.

The Prague Trio of Basset-horns, based in the Czech Republic, has a repertoire of music written or transcribed for three basset horns, by composers including Mozart, Scott Joplin, and Paul Desmond.

Suzanne Stephens was a leading basset-horn specialist in contemporary music. Starting in 1974, the German Karlheinz Stockhausen composed many new works for her, including a large number for basset-horn with a solo rolo in his opera LIGHT. Other interprets of Stockhausens music are among others the Dutch Fie Schouten and the Italian Michele Marelli.

Alternative usage
The Italian name for the instrument, corno di bassetto, was used by Bernard Shaw as a pseudonym when writing music criticism.

title: Basset horn


text:
Maximum flow problem

In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate.

The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow (i.e., flow from source s to sink t) is equal to the minimum capacity of an s-t cut (i.e., cut severing s from t) in the network, as stated in the max-flow min-cut theorem.

History
The maximum flow problem was first formulated in 1954 by T. E. Harris and F. S. Ross as a simplified model of Soviet railway traffic flow. In 1955, Lester R. Ford, Jr. and Delbert R. Fulkerson created the first known algorithm, the Ford–Fulkerson algorithm. In their 1955 paper, Ford and Fulkerson wrote that the problem of Harris and Ross is formulated as follows (see p. 5):"Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given city to the other."In their book Flows in Network, in 1962, Ford and Fulkerson wrote:"It was posed to the authors in the spring of 1955 by T. E. Harris, who, in conjunction with General F. S. Ross (Ret.), had formulated a simplified model of railway traffic flow, and pinpointed this particular problem as the central one suggested by the model [11]."where [11] refers to the 1955 secret report Fundamentals of a Method for Evaluating Rail net Capacities by Harris and Ross (see p. 5).

Over the years, various improved solutions to the maximum flow problem were discovered, notably the shortest augmenting path algorithm of Edmonds and Karp and independently Dinitz; the blocking flow algorithm of Dinitz; the push-relabel algorithm of Goldberg and Tarjan; and the binary blocking flow algorithm of Goldberg and Rao. The algorithms of Sherman and Kelner, Lee, Orecchia and Sidford, respectively, find an approximately optimal maximum flow but only work in undirected graphs.

In 2013 James B. Orlin published a paper describing an $$O(|V| |E|)$$ algorithm.

In 2022 Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva published an almost-linear time algorithm running in $$O(|E|^{1+o(1)})$$ for the minimum-cost flow problem of which for the maximum flow problem is a particular case. For the single-source shortest path (SSSP) problem with negative weights another particular case of minimum-cost flow problem an algorithm in almost-linear time has also been reported. Both algorithms were deemed best papers at the 2022 Symposium on Foundations of Computer Science.

Definition

First we establish some notation:
 * Let $$N = (V, E)$$ be a network with $$s, t \in V$$ being the source and the sink of $$N$$ respectively.
 * If $$g$$ is a function on the edges of $$N$$ then its value on $$(u,v) \in E$$ is denoted by $$g_{uv}$$ or $$g(u,v).$$

Definition. The capacity of an edge is the maximum amount of flow that can pass through an edge. Formally it is a map $$c: E \to \R^+.$$

Definition. A flow is a map $$f : E \to \R$$ that satisfies the following:
 * Capacity constraint. The flow of an edge cannot exceed its capacity, in other words: $$f_{uv} \leq c_{uv}$$ for all $$(u, v) \in E.$$
 * Conservation of flows. The sum of the flows entering a node must equal the sum of the flows exiting that node, except for the source and the sink. Or:
 * $$\forall v \in V \setminus \{s, t\}: \quad \sum_{u:(u, v) \in E, f_{uv}>0} f_{uv} = \sum_{u:(v, u) \in E, f_{vu}>0} f_{vu}.$$

Remark. Flows are skew symmetric: $$f_{uv} = -f_{vu}$$ for all $$(u, v) \in E.$$

Definition. The value of flow is the amount of flow passing from the source to the sink. Formally for a flow $$f : E \to \R^+$$ it is given by:
 * $$|f| = \sum_{v:\ (s,v) \in E} f_{sv} = \sum_{u:\ (u,t) \in E} f_{ut}.$$

Definition. The maximum flow problem is to route as much flow as possible from the source to the sink, in other words find the flow $$f_\textrm{max}$$ with maximum value.

Note that several maximum flows may exist, and if arbitrary real (or even arbitrary rational) values of flow are permitted (instead of just integers), there is either exactly one maximum flow, or infinitely many, since there are infinitely many linear combinations of the base maximum flows. In other words, if we send $$x$$ units of flow on edge $$u$$ in one maximum flow, and $$y > x$$ units of flow on $$u$$ in another maximum flow, then for each $$\Delta \in [0, y-x]$$ we can send $$x+\Delta$$ units on $$u$$ and route the flow on remaining edges accordingly, to obtain another maximum flow. If flow values can be any real or rational numbers, then there are infinitely many such $$\Delta$$ values for each pair $$x, y$$.

Algorithms
The following table lists algorithms for solving the maximum flow problem. Here, $$V$$ and $$E$$ denote the number of vertices and edges of the network. The value $$U$$ refers to the largest edge capacity after rescaling all capacities to integer values (if the network contains irrational capacities, $$U$$ may be infinite).

For additional algorithms, see.

Integral flow theorem
The integral flow theorem states that
 * If each edge in a flow network has integral capacity, then there exists an integral maximal flow.

The claim is not only that the value of the flow is an integer, which follows directly from the max-flow min-cut theorem, but that the flow on every edge is integral. This is crucial for many combinatorial applications (see below), where the flow across an edge may encode whether the item corresponding to that edge is to be included in the set sought or not.

Multi-source multi-sink maximum flow problem
Given a network $$N = (V, E)$$ with a set of sources $$S = \{s_1, \ldots, s_n\}$$ and a set of sinks $$T = \{t_1, \ldots, t_m\}$$ instead of only one source and one sink, we are to find the maximum flow across $$N$$. We can transform the multi-source multi-sink problem into a maximum flow problem by adding a consolidated source connecting to each vertex in $$S$$ and a consolidated sink connected by each vertex in $$T$$ (also known as supersource and supersink) with infinite capacity on each edge (See Fig. 4.1.1.).

Maximum cardinality bipartite matching
Given a bipartite graph $$G = (X \cup Y, E)$$, we are to find a maximum cardinality matching in $$G$$, that is a matching that contains the largest possible number of edges. This problem can be transformed into a maximum flow problem by constructing a network $$N = (X \cup Y \cup \{s,t\}, E')$$, where
 * 1) $$E'$$ contains the edges in $$G$$ directed from $$X$$ to $$Y$$.
 * 2) $$(s,x) \in E'$$ for each $$x \in X$$ and $$(y,t) \in E'$$ for each $$y \in Y$$.
 * 3) $$c(e) = 1$$ for each $$e \in E'$$ (See Fig. 4.3.1).

Then the value of the maximum flow in $$N$$ is equal to the size of the maximum matching in $$G$$, and a maximum cardinality matching can be found by taking those edges that have flow $$1$$ in an integral max-flow.

Minimum path cover in directed acyclic graph
Given a directed acyclic graph $$G = (V, E)$$, we are to find the minimum number of vertex-disjoint paths to cover each vertex in $$V$$. We can construct a bipartite graph $$G' = (V_\textrm{out} \cup V_\textrm{in}, E')$$ from $$G$$, where
 * 1) $$V_\textrm{out} = \{ v_\textrm{out} \mid v \in V \land v \text{ has outgoing edge(s)} \}$$
 * 2) $$V_\textrm{in} = \{ v_\textrm{in} \mid v \in V \land v \text{ has incoming edge(s)} \}$$
 * 3) $$E' = \{(u_\textrm{out}, v_\textrm{in}) \in V_{out} \times V_{in} \mid (u, v) \in E \}$$.

Then it can be shown that $$G'$$ has a matching $$M$$ of size $$m$$ if and only if $$G$$ has a vertex-disjoint path cover $$C$$ containing $$m$$ edges and $$n-m$$ paths, where $$n$$ is the number of vertices in $$G$$. Therefore, the problem can be solved by finding the maximum cardinality matching in $$G'$$ instead.

Assume we have found a matching $$M$$ of $$G'$$, and constructed the cover $$C$$ from it. Intuitively, if two vertices $$u_\mathrm{out}, v_\mathrm{in}$$ are matched in $$M$$, then the edge $$(u, v)$$ is contained in $$C$$. Clearly the number of edges in $$C$$ is $$m$$. To see that $$C$$ is vertex-disjoint, consider the following: Thus no vertex has two incoming or two outgoing edges in $$C$$, which means all paths in $$C$$ are vertex-disjoint.
 * 1) Each vertex $$v_\textrm{out}$$ in $$G'$$ can either be non-matched in $$M$$, in which case there are no edges leaving $$v$$ in $$C$$; or it can be matched, in which case there is exactly one edge leaving $$v$$ in $$C$$. In either case, no more than one edge leaves any vertex $$v$$ in $$C$$.
 * 2) Similarly for each vertex $$v_\textrm{in}$$ in $$G'$$ – if it is matched, there is a single incoming edge into $$v$$ in $$C$$; otherwise $$v$$ has no incoming edges in $$C$$.

To show that the cover $$C$$ has size $$n-m$$, we start with an empty cover and build it incrementally. To add a vertex $$u$$ to the cover, we can either add it to an existing path, or create a new path of length zero starting at that vertex. The former case is applicable whenever either $$(u,v) \in E$$ and some path in the cover starts at $$v$$, or $$(v,u) \in E$$ and some path ends at $$v$$. The latter case is always applicable. In the former case, the total number of edges in the cover is increased by 1 and the number of paths stays the same; in the latter case the number of paths is increased and the number of edges stays the same. It is now clear that after covering all $$n$$ vertices, the sum of the number of paths and edges in the cover is $$n$$. Therefore, if the number of edges in the cover is $$m$$, the number of paths is $$n-m$$.

Maximum flow with vertex capacities

Let $$N = (V, E)$$ be a network. Suppose there is capacity at each node in addition to edge capacity, that is, a mapping $$c: V\to \R^+,$$ such that the flow $$f$$ has to satisfy not only the capacity constraint and the conservation of flows, but also the vertex capacity constraint

 * $$ \sum_{i\in V} f_{iv} \le c(v) \qquad \forall v \in V \backslash \{s,t\}.$$

In other words, the amount of flow passing through a vertex cannot exceed its capacity. To find the maximum flow across $$N$$, we can transform the problem into the maximum flow problem in the original sense by expanding $$N$$. First, each $$v\in V$$ is replaced by $$v_{\text{in}}$$ and $$v_{\text{out}}$$, where $$v_{\text{in}}$$ is connected by edges going into $$v$$ and $$v_{\text{out}}$$ is connected to edges coming out from $$v$$, then assign capacity $$c(v)$$ to the edge connecting $$v_{\text{in}}$$ and $$v_{\text{out}}$$ (see Fig. 4.4.1). In this expanded network, the vertex capacity constraint is removed and therefore the problem can be treated as the original maximum flow problem.

Maximum number of paths from s to t
Given a directed graph $$G = (V, E)$$ and two vertices $$s$$ and $$t$$, we are to find the maximum number of paths from $$s$$ to $$t$$. This problem has several variants:

1. The paths must be edge-disjoint. This problem can be transformed to a maximum flow problem by constructing a network $$N = (V, E)$$ from $$G$$, with $$s$$ and $$t$$ being the source and the sink of $$N$$ respectively, and assigning each edge a capacity of $$1$$. In this network, the maximum flow is $$k$$ iff there are $$k$$ edge-disjoint paths.

2. The paths must be independent, i.e., vertex-disjoint (except for $$s$$ and $$t$$). We can construct a network $$N = (V, E)$$ from $$G$$ with vertex capacities, where the capacities of all vertices and all edges are $$1$$. Then the value of the maximum flow is equal to the maximum number of independent paths from $$s$$ to $$t$$.

3. In addition to the paths being edge-disjoint and/or vertex disjoint, the paths also have a length constraint: we count only paths whose length is exactly $$k$$, or at most $$k$$. Most variants of this problem are NP-complete, except for small values of $$k$$.

Closure problem
A closure of a directed graph is a set of vertices C, such that no edges leave C. The closure problem is the task of finding the maximum-weight or minimum-weight closure in a vertex-weighted directed graph. It may be solved in polynomial time using a reduction to the maximum flow problem.

Baseball elimination
In the baseball elimination problem there are n teams competing in a league. At a specific stage of the league season, wi is the number of wins and ri is the number of games left to play for team i and rij is the number of games left against team j. A team is eliminated if it has no chance to finish the season in the first place. The task of the baseball elimination problem is to determine which teams are eliminated at each point during the season. Schwartz proposed a method which reduces this problem to maximum network flow. In this method a network is created to determine whether team k is eliminated.

Let G = (V, E) be a network with $s,t ∈ V$ being the source and the sink respectively. One adds a game nodeij – which represents the number of plays between these two teams. We also add a team node for each team and connect each game node $\{i, j\}$ with i < j to V, and connects each of them from s by an edge with capacity rij – which represents the number of plays between these two teams. We also add a team node for each team and connect each game node $\{i, j\}$ with two team nodes i and j to ensure one of them wins. One does not need to restrict the flow value on these edges. Finally, edges are made from team node i to the sink node t and the capacity of $w_{k} + r_{k} – w_{i}$ is set to prevent team i from winning more than $w_{k} + r_{k}$. Let S be the set of all teams participating in the league and let
 * $$r(S - \{k\}) = \sum_{i,j \in \{S-\{k\}\} \atop i < j} r_{ij}$$.

In this method it is claimed team k is not eliminated if and only if a flow value of size r(S − {k}) exists in network G. In the mentioned article it is proved that this flow value is the maximum flow value from s to t.

Airline scheduling
In the airline industry a major problem is the scheduling of the flight crews. The airline scheduling problem can be considered as an application of extended maximum network flow. The input of this problem is a set of flights F which contains the information about where and when each flight departs and arrives. In one version of airline scheduling the goal is to produce a feasible schedule with at most k crews.

To solve this problem one uses a variation of the circulation problem called bounded circulation which is the generalization of network flow problems, with the added constraint of a lower bound on edge flows.

Let G = (V, E) be a network with $s,t ∈ V$ as the source and the sink nodes. For the source and destination of every flight i, one adds two nodes to V, node si as the source and node di as the destination node of flight i. One also adds the following edges to E:
 * 1) An edge with capacity [0, 1] between s and each si.
 * 2) An edge with capacity [0, 1] between each di and t.
 * 3) An edge with capacity [1, 1] between each pair of si and di.
 * 4) An edge with capacity [0, 1] between each di and sj, if source sj is reachable with a reasonable amount of time and cost from the destination of flight i.
 * 5) An edge with capacity [0, ∞] between s and t.

In the mentioned method, it is claimed and proved that finding a flow value of k in G between s and t is equal to finding a feasible schedule for flight set F with at most k crews.

Another version of airline scheduling is finding the minimum needed crews to perform all the flights. To find an answer to this problem, a bipartite graph $G' = (A ∪ B, E)$ is created where each flight has a copy in set A and set B. If the same plane can perform flight j after flight i, $i∈A$ is connected to $j∈B$. A matching in $G'$ induces a schedule for F and obviously maximum bipartite matching in this graph produces an airline schedule with minimum number of crews. As it is mentioned in the Application part of this article, the maximum cardinality bipartite matching is an application of maximum flow problem.

Circulation–demand problem
There are some factories that produce goods and some villages where the goods have to be delivered. They are connected by a networks of roads with each road having a capacity $c$ for maximum goods that can flow through it. The problem is to find if there is a circulation that satisfies the demand. This problem can be transformed into a maximum-flow problem. Let G = (V, E) be this new network. There exists a circulation that satisfies the demand if and only if :
 * 1) Add a source node $s$ and add edges from it to every factory node $f_{i}$ with capacity $p_{i}$ where $p_{i}$ is the production rate of factory $f_{i}$.
 * 2) Add a sink node $t$ and add edges from all villages $v_{i}$ to $t$ with capacity $d_{i}$ where $d_{i}$ is the demand rate of village $v_{i}$.
 * $Maximum flow value(G)$ $$ = \sum_{i \in v} d_i $$.

If there exists a circulation, looking at the max-flow solution would give the answer as to how much goods have to be sent on a particular road for satisfying the demands.

The problem can be extended by adding a lower bound on the flow on some edges.

Image segmentation
In their book, Kleinberg and Tardos present an algorithm for segmenting an image. They present an algorithm to find the background and the foreground in an image. More precisely, the algorithm takes a bitmap as an input modelled as follows: ai ≥ 0 is the likelihood that pixel i belongs to the foreground, bi ≥ 0 in the likelihood that pixel i belongs to the background, and pij is the penalty if two adjacent pixels i and j are placed one in the foreground and the other in the background. The goal is to find a partition (A, B) of the set of pixels that maximize the following quantity

 * $$q(A, B) = \sum_{i \in A} a_i + \sum_{i \in B} b_i - \sum_{\begin{matrix}i, j \text{ adjacent} \\ |A \cap \{i, j\}| = 1 \end{matrix}} p_{ij}$$,

Indeed, for pixels in A (considered as the foreground), we gain ai; for all pixels in B (considered as the background), we gain bi. On the border, between two adjacent pixels i and j, we loose pij. It is equivalent to minimize the quantity

 * $$q'(A, B) = \sum_{i \in A} b_i + \sum_{i \in B} a_i + \sum_{\begin{matrix}i, j \text{ adjacent} \\ |A \cap \{i, j\}| = 1 \end{matrix}} p_{ij}$$

because

 * $$q(A, B) = \sum_{i \in A\cup B} a_i + \sum_{i \in A\cup B} b_i - q'(A, B).$$

We now construct the network whose nodes are the pixel, plus a source and a sink, see Figure on the right. We connect the source to pixel i by an edge of weight ai. We connect the pixel i to the sink by an edge of weight bi. We connect pixel i to pixel j with weight pij. Now, it remains to compute a minimum cut in that network (or equivalently a maximum flow). The last figure shows a minimum cut.

Extensions
1. In the minimum-cost flow problem, each edge (u,v) also has a cost-coefficient auv in addition to its capacity. If the flow through the edge is fuv, then the total cost is auvfuv. It is required to find a flow of a given size d, with the smallest cost. In most variants, the cost-coefficients may be either positive or negative. There are various polynomial-time algorithms for this problem.

2. The maximum-flow problem can be augmented by disjunctive constraints: a negative disjunctive constraint says that a certain pair of edges cannot simultaneously have a nonzero flow; a positive disjunctive constraints says that, in a certain pair of edges, at least one must have a nonzero flow. With negative constraints, the problem becomes strongly NP-hard even for simple networks. With positive constraints, the problem is polynomial if fractional flows are allowed, but may be strongly NP-hard when the flows must be integral.

title: Maximum flow problem